Reduced complexity MMSE multiuser detection for a multirate CDMA link

ABSTRACT

A system to decode a multirate CDMA signal. In one aspect the system includes a high rate detector to generate high rate outputs based upon decoding an input signal that includes high rate users and low rate users. The high rate outputs include actual high rate users and effective high rate users. A second stage applies a first linear transformation to the high rate outputs to generate second stage outputs. A third stage applies a second linear transformation to the second stage outputs to generate decoupled low rate user outputs and decoupled actual high rate user outputs.

TECHNICAL FIELD

[0001] An aspect of this invention relates to multirate code-division multiple access (CDMA) detection systems.

BACKGROUND

[0002] Until recently, conventional CDMA detection has been accomplished by using single-user detectors in which each user is detected separately via a matched filter (or correlator) receiver. Detection of each user is done without regard for the existence of other co-channel users.

[0003] Recently, multiuser detection has been developed for wireless communication. In multiuser detection, information (e.g., code, timing, channel) of multiple users is jointly used to better detect each individual user. Conventional minimum mean square error (MMSE) multiuser detection may offer significant performance improvements over conventional CDMA detection, but at the cost of increased receiver complexity. In conventional symbol level MMSE multiuser detection, a linear transformation that minimizes the mean square error may be applied to the outputs of the conventional detector for each user of a single rate system in order to decouple the co-channel interfering users. The computation of the standard MMSE linear transformation may involve a matrix inversion, where the order of the matrix is proportional to the number of users. As the order of the matrix increases, the computation of the inverse matrix becomes more difficult.

[0004] In a multirate system, a high-rate data user operating at M times the data rate of a low-rate user, appears to a conventional MMSE detector as M low-rate users, causing a significant increase in the order of the matrix and resulting computation complexity. In other words, an MMSE linear transformation may be applied every low-rate symbol interval to the conventional detector outputs of all symbols from all users that occur in the low-rate user symbol interval.

DESCRIPTION OF DRAWINGS

[0005]FIG. 1 shows a block diagram of an embodiment of a multiuser detector.

[0006]FIG. 2 shows a representation of input signals in a multiuser detector.

[0007]FIG. 3A shows a flow chart of the operation of an embodiment of a symbol-level detector.

[0008]FIG. 3B shows a timing diagram of a received signal that may be detected by the symbol-level detector.

[0009]FIG. 4A shows a representation of an exemplary multirate system.

[0010]FIG. 4B shows a block diagram of an embodiment of a multiuser detector.

[0011]FIG. 5 shows a flow chart of the operation of an embodiment of a multiuser detector.

[0012]FIG. 6A shows a representation of another embodiment of a multirate system.

[0013]FIG. 6B shows a block diagram of another embodiment of a multiuser detector.

[0014]FIG. 7 shows a flow chart of the operation of an embodiment of a multiuser detector

[0015]FIG. 8 shows a block diagram of a wireless device including a multiuser detector.

[0016] Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

[0017]FIG. 1 shows a detector 10 for detecting data in a received signal 16 of a multirate DS-CDMA communication system. Channels in the received signal 16 may be de-spread with the channels' code waveforms via the conventional detector 18, (bank of correlators, i.e., matched filters). The detector 10 uses MMSE processing 12 over a reduced observation interval 14 to detect one or more data users 17 within the received signal 16. The received signal 16 may include data users having a range of user rates. For example, in a system having two user rates, the high-rate users may be detected in the presence of low-rate users or the low-rate users themselves may be detected. The MMSE processing 12 may be conducted at both the symbol level 12 a and the chip level 12 b. For symbol-level MMSE processing, the soft symbol outputs of the conventional detector 18 are passed to the MMSE processor 12 a. For chip-level MMSE processing, the received signal is passed directly to the chip-level MMSE processor 12 b.

[0018] Using a reduced observation interval translates to fewer symbols processed, which can significantly reduce the complexity of the MMSE processing.

[0019] Downlink Spreading Codes

[0020] The detector 10 may detect signals that include spreading codes that are selected because of a property that enables a reduction in complexity of multiuser detection. Such spreading codes are used in 2^(nd) and 3^(rd) generation CDMA downlink systems and their property can be described as follows for a two user-rate system. Given that we have a system with low-rate users characterized by spreading factor SF_(L)=2^(m) ^(_(L)) (i.e., symbol interval and code words are 2^(m) ^(_(L)) chips), and high-rate users characterized by spreading factor SF_(H)=2^(m) ^(_(H)) (i.e., symbol interval is 2^(m) ^(_(H)) chips), where m_(L)>m_(H); then in the high-rate symbol interval of length 2 ^(m) ^(_(H)) chips there will be up to 2^(m) ^(_(L)) ^(-m) ^(_(H)) low-rate users that have identical high-rate (length 2^(m) ^(_(H)) ) code-words to within a sign change.

[0021] By utilizing the above-described spreading codes property, up to 2^(m) ^(-m) ^(_(H)) low-rate users can be collapsed into an “equivalent” or “effective” high-rate user. Doing so allows reducing dimensionality of the matrix manipulations inherent in MMSE linear multiuser detection.

[0022] The spreading factor property described above is present in the Orthogonal Variable Spreading Factor (OVSF) codes that are used as the downlink spreading codes of the 3GPP third generation Wideband CDMA cellular system: $\begin{matrix} {\begin{bmatrix} c_{2^{n},0} \\ c_{2^{n},1} \\ c_{2^{n},2} \\ \vdots \\ c_{2^{n},{2^{n} - 1}} \end{bmatrix} = \begin{bmatrix} c_{2^{n - 1},0} & c_{2^{n - 1},0} \\ c_{2^{n - 1},0} & {- c_{2^{n - 1},0}} \\ c_{2^{n - 1},1} & c_{2^{n - 1},1} \\ c_{2^{n - 1},1} & {- c_{2^{n - 1},1}} \\ \quad & \quad \\ c_{2^{n - 1},{2^{n - 1} - 1}} & c_{2^{n - 1},{2^{n - 1} - 1}} \\ c_{2^{n - 1},{2^{n - 1} - 1}} & {- c_{2^{n - 1},{2^{n - 1} - 1}}} \end{bmatrix}} & {{{Eq}.\quad 1}a} \end{matrix}$

[0023] where c₂ _(^(n)) _(,i) is the ith spreading code available with spreading factor 2^(n), (a vector of length 2^(n)), and where c_(1,0)=1. In order to efficiently allocate the above codes in a multirate system, users codes are assigned according to a tree structure 20 shown in FIG. 2.

[0024] If any node of the tree 20 has been assigned to a user, none of the nodes underneath can be utilized. Thus, user code assignments are grouped in the smallest possible sub-tree structure. The orthogonal Walsh spreading codes that are currently being used on the IS-95 CDMA and cdma2000 downlinks are essentially equivalent to the above codes. The codes described here also have the property of being orthogonal. However, in the presence of multipath, the orthogonality property may be partially lost, since the code words between multipath components are not time-aligned. In addition, orthogonality may not available between downlink signals of different cells.

[0025] Eq. 1a defines the downlink spreading codes of length 2^(n) in terms of codes of length 2²⁻¹. Expanding this for arbitrary m_(L)>m_(H): $\begin{matrix} {{g_{2^{m_{L}},i} = {{\left\lfloor {H_{i,1}^{\prime}g_{2^{m_{H}},j}\quad H_{i,2}^{\prime}g_{2^{m_{H}},j}\quad \cdots \quad H_{i,2^{m_{L} - m_{H}}}^{\prime}g_{2^{m_{H}},j}} \right\rfloor^{T}\quad j} = 1}},2,\ldots \quad,{{2^{m_{H}}\quad i} = 1},2,\ldots \quad,2^{m_{L} - m_{H}}} & {{{Eq}.\quad 1}b} \end{matrix}$

[0026] where └H′_(i,1) H′_(i,2) . . . H′_(i,2) _(^(m)) _(L) _(^(-m)) _(H)┘ is a column of the Walsh-Hadamard matrix transform of size 2^(m) ^(_(L)) ^(-m) ^(_(H, (H′)) _(i,1)ε±1). (Note that x′ will be used here to denote the conjugate transpose of x.) Thus, for each spread factor 2^(m) ^(_(H)) code, e.g., g₂ _(^(m)) _(H,j), up to 2^(m) ^(_(L)) ^(-m) ^(_(H)) code words of length (spread factor) 2^(m) ^(_(L)) can be generated. This, once again, illustrates the code property described above.

[0027] Based on the above discussion, K_(L) low-rate user code words can be generated from a single high-rate user code word by the following simple matrix operation: $\begin{matrix} \begin{matrix} {\left\lfloor {g_{2^{m_{L}},1}\quad g_{2^{m_{L},2}}\quad \cdots \quad g_{2^{m_{L}},K_{L}}} \right\rfloor = {{D\left( g_{2^{m_{H}},j} \right)}H_{K_{L}}}} \\ {= {\begin{bmatrix} \left\lbrack g_{2^{m_{H}},j} \right\rbrack & \quad & 0 \\ \quad & \left\lbrack g_{2^{m_{H}},j} \right\rbrack & \quad \\ 0 & \quad & \left\lbrack g_{2^{m_{H}},j} \right\rbrack \end{bmatrix}H_{K_{L}}}} \end{matrix} & {{{Eq}.\quad 1}c} \end{matrix}$

[0028] where H_(K) _(L) a matrix containing K_(L) columns of a Walsh Hadamard transform of order 2^(m) ^(_(L)) ^(-m) ^(_(H)) , and D(g₂ _(^(m)) _(H,j)) contains 2^(m) ^(_(L)) ^(-m) ^(_(H)) columns, with each successive column containing the identical spread-factor 2^(m) ^(_(H)) code shifted down by an additional 2^(m) ^(_(H)) chips.

[0029] The quantity of user rates in the system may be generalized to an arbitrary number of possible rates. In other words, a single spreading code of spread-factor 2^(m) can generate: 2^(m) ^(_(L)) ^(-m) codes of length 2^(m) ^(₁) , 2^(m) ^(₂) ^(-m) codes of length ₂ m₂, etc., for m_(i)>m. Similarly, by breaking the information up into smaller observation intervals of length 2^(m), up to 2^(m) ^(₁) ^(-m) users of spread-factor 2^(m) ^(_(L)) map (“collapse”) into a single “effective” high-rate user of spread-factor 2^(m), and up to 2^(m) ^(₂) ^(-m) users of spread-factor 2^(m) ^(₂) map (“collapse”) into a single “effective” high-rate user of spread-factor ₂m, etc.

[0030] An embodiment describes the limited case in which the detector detects a received signal that includes two user rates: high-rate (spread-factor 2^(m) ^(_(H)) ) and low-rate (spread-factor 2^(m) ^(_(L)) ). It should be understood that a virtually unlimited number of user rates may be included in the received signal.

[0031] STAP and FEC

[0032] The receiver methods described here may include multi-antenna space-time adaptive processing (STAP) and forward error correction (FEC) coding. Thus, the receiver algorithms described here can be preceded by a front-end STAP processing (i.e., the linear transformation can be applied after the STAP combining of the different antenna received signal streams). The receiver algorithms may also be used in conjunction with FEC coding such that the linear transformations discussed here provide improved soft values for the coded symbol stream, which are then fed into the FEC decoder to recover the information bits.

[0033] Interference Cancellation

[0034] The receiver methods described here may be used in conjunction with interference cancellation methods. For example, the inputs to the algorithms described here can include the output of an interference cancellation algorithm where the received signal (in the case of chip-level processing) or the conventional detector outputs (in the case of symbol-level processing) are first “cleaned” of some of the interfering signals, i.e., the interference is estimated and subtracted out. Alternatively, interference may also be estimated and subtracted out at the outputs of the receiver algorithms described here.

[0035] Multirate Multiuser Systems and Symbol-Level Processing

[0036]FIG. 3A shows one aspect of a symbol-level detector 30 in accordance with the principles of the invention. The symbol-level detector 30 includes three stages to detect high-rate and low-rate users. The first stage is a high rate detector 32 that is applied at the high symbol rate to the received signal to process the low-rate users as well as the high-rate users. Because of the spreading code properties described earlier, multiple low-rate users collapse into a single “effective” high-rate user in the high-rate processing interval. The high rate detector 32 generates soft outputs for the actual high-rate users and the effective high-rate users. The high rate detector 32 may be any linear filter including a bank of correlators, and a matched filter bank, (i.e., the conventional detector for each user).

[0037] The second stage 34 applies a high-rate linear MMSE transformation to the high-rate outputs of the first stage to produce new soft outputs for the high-rate users and the effective high-rate users, where these outputs will be decoupled to an extent from one another. The linear MMSE transformation serves to minimize the mean square error between the actual transmitted symbols and the output of the transformation. The third stage 36 then applies a linear MMSE transformation to the group of effective high-rate soft outputs of the second stage 34 over the low-rate interval, in order to decouple the low-rate user data embedded in the effective high-rate user outputs. One of the second and third stages 34 and 36 may also be any linear detector. The functions of the second stage 34 and the third stage 36 may be interchanged in different embodiments.

[0038]FIG. 3B shows a timing diagram of a received signal that may be detected by a symbol-level detector 30. The exemplary received signal shows a 3 user synchronous system, where the code waveforms of two of the users 37 a and 37 b have a spreading factor of 4, and the code word of the third user 39 has a spreading factor of 2, (i.e., the third user has twice the data rate of the first two users). The symbol time of the low-rate users 37 a and 37 b is T₀ and the symbol time of the high rate user 39 is T₀/2. For an observation interval of T₀, the received signal can be written as: $\begin{matrix} \begin{matrix} {r = {{GAd} + n}} \\ {= {{{\left\lbrack {{\begin{bmatrix} g_{1} \\ \quad \end{bmatrix}\begin{bmatrix} g_{2} \\ \quad \end{bmatrix}}\begin{matrix} \left\lbrack g_{3A} \right\rbrack \\ \lbrack 0\rbrack \end{matrix}\begin{matrix} \lbrack 0\rbrack \\ \left\lbrack g_{3B} \right\rbrack \end{matrix}} \right\rbrack \begin{bmatrix} A_{1} & 0 & 0 & 0 \\ 0 & A_{2} & 0 & 0 \\ 0 & 0 & A_{3A} & 0 \\ 0 & 0 & 0 & A_{3B} \end{bmatrix}}\begin{bmatrix} d_{1} \\ d_{2} \\ d_{3A} \\ d_{3B} \end{bmatrix}} + n}} \end{matrix} & {{{Eq}.\quad 2}a} \end{matrix}$

[0039] where g_(i) is the code word of symbol i. Similarly, the outputs of the conventional detector can be written as $\begin{matrix} \begin{matrix} {y = {{RAd} + z}} \\ {= {{{\begin{bmatrix} 1 & \rho_{1,2} & \rho_{1,{3A}} & \rho_{1,{3B}} \\ \rho_{2,1} & 1 & \rho_{2,{3A}} & \rho_{2,{3B}} \\ \rho_{{3A},1} & \rho_{{3A},2} & 1 & 0 \\ \rho_{{3B},1} & \rho_{{3B},2} & 0 & 1 \end{bmatrix}\begin{bmatrix} A_{1} & 0 & 0 & 0 \\ 0 & A_{2} & 0 & 0 \\ 0 & 0 & A_{3A} & 0 \\ 0 & 0 & 0 & A_{3B} \end{bmatrix}}\begin{bmatrix} d_{1} \\ d_{2} \\ d_{3A} \\ d_{3B} \end{bmatrix}} +}} \\ {\begin{bmatrix} z_{1} \\ z_{2} \\ z_{3A} \\ z_{3B} \end{bmatrix}} \end{matrix} & {{{Eq}.\quad 2}b} \end{matrix}$

[0040] where ρ_(i,j) is the correlation between the code words of symbols i and j. The symbols of all users can be recovered by applying a linear transformation to these outputs. For example, if we apply a decorrelating detector, then we obtain the following soft outputs for each user symbol:

y _(dec) =Ad+z _(dec)  Eq. 3

[0041] Note that in this case, where there is a synchronous channel, T₀ is the ideal observation interval needed for optimal detection.

[0042] Alternatively, a smaller observation interval for sub-optimal reduced complexity detection can be used. If the observation interval is T₀/2, for the first interval: $\begin{matrix} \begin{matrix} {{y\lbrack 1\rbrack} = {{{R\lbrack 1\rbrack}{A\lbrack 1\rbrack}{d\lbrack 1\rbrack}} + {z\lbrack 1\rbrack}}} \\ {= {{{\begin{bmatrix} 1 & \rho_{{1A},{2A}} & \rho_{{1A},{3A}} \\ \rho_{{2A},{1A}} & 1 & \rho_{{2A},{3A}} \\ \rho_{{3A},{1A}} & \rho_{{3A},{2A}} & 1 \end{bmatrix}\begin{bmatrix} A_{1} & 0 & 0 \\ 0 & A_{2} & 0 \\ 0 & 0 & A_{3} \end{bmatrix}}\begin{bmatrix} d_{1} \\ d_{2} \\ d_{3A} \end{bmatrix}} +}} \\ {\begin{bmatrix} z_{1} \\ z_{2} \\ z_{3A} \end{bmatrix}} \end{matrix} & {{Eq}.\quad 4} \end{matrix}$

[0043] and a similar equation can be written for the second interval as well.

[0044] A linear transformation can be applied separately for each T₀/2 interval to reduce the MAI and recover the data. For the high-rate user, one symbol is recovered in each interval. For the low-rate user, half of a symbol is recovered in each interval, and maximal ratio combination between them can be used to produce an estimate of the symbol. For example, if the decorrelating detector approach is applied to the two intervals of FIG. 3B then,

y _(dec)[1]=R[1]⁻¹ y[1]

y _(dec)[2]=R[2]⁻¹ y[2]

[0045] and user 1's symbol may be recovered from: $\begin{matrix} {{\hat{d}}_{1} = {{sgn}\left\{ {\frac{{y_{dec}\lbrack 1\rbrack}_{1}}{{R\lbrack 1\rbrack}_{1,1}^{- 1}} + \frac{{y_{dec}\lbrack 2\rbrack}_{1}}{{R\lbrack 2\rbrack}_{2,2}^{- 1}}} \right\}}} & {{Eq}.\quad 6} \end{matrix}$

[0046] where the subscripts are vector/matrix indices, and [j] refers to interval j. Although this approach is suboptimal, by reducing the size of our observation interval (i.e, operating at the high-rate user rate), we reduced the order of R is reduced from 4 in Eq. 7, to 3 in Eq. 10. Since matrix inversion increases in complexity on the order of N³, where N is the order of the matrix. Here, this reduces we have reduced the complexity of the linear multiuser detection, and reduces detection delay for the high rate user by T₀/2. For high-rate users which are many times the data rate of the lowest rate user, the complexity savings may be substantial. For example, in a dual-rate system with high-rate users at M times the data rate of the low-rate users, opting for the high-rate one-shot decorrelator described above reduces the interfering symbols in the observation interval (as well as the dimensionality of the correlation matrix, R) by M−1 for each high-rate user.

[0047] Note that instead of taking the sign of the quantity in parenthesis in Eq. 6, i.e., making a “hard decision”, we can pass its “soft” value to a decoder for FEC decoding. The improved “soft decisions” for the coded symbols can then lead to improved decoding of the underlying information bits.

[0048] Received Signal Model

[0049] Assume that a single spreading code of length (spread-factor) 2^(m) ^(_(L)) chips is used to generate K_(L) user codes of length 2^(m) ^(_(L)) chips, as described in Eq. 1c, where (without loss of generality) K_(L)≦2^(m) ^(_(L)) ^(-m) ^(_(H)) . Assume also that there are K_(H) high-rate users of spread-factor 2^(m) ^(_(H)) , and for generality, that there is an other-cell user as well, (which will be denoted by the subscript “oc”). The model described here accommodates multiple other-cell users as well. The received signal can, therefore, be expressed as

r=[r[1]^(T) r[2]^(T) . . . r[2^(m) ^(_(H)) ^(-m) ^(_(L)) ]^(T)]^(T)  Eq. 7

[0050] where r[j] is a vector of the received signal chip samples in the jth 2^(m) ^(_(L)) -chip subinterval, and it can be expressed as $\begin{matrix} \begin{matrix} {{r\lbrack j\rbrack} = \left\lbrack {g_{2^{m_{H}}}^{(L)}\quad g_{2^{m_{H}},1}^{\quad}\quad g_{2^{m_{H}},2}^{\quad}\quad \cdots \quad g_{2^{m_{H}},K_{H}}^{\quad}\quad {g_{oc}\lbrack j\rbrack}} \right\rbrack} \\ {{~~~~~}{\begin{bmatrix} {\sum\limits_{i = 1}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,j}^{\prime}}} \\ {{A_{1}^{(H)}\lbrack j\rbrack}{d_{1}^{(H)}\lbrack j\rbrack}} \\ {{A_{2}^{(H)}\lbrack j\rbrack}{d_{2}^{(H)}\lbrack j\rbrack}} \\ \vdots \\ {{A_{K_{H}}^{(H)}\lbrack j\rbrack}{d_{K_{H}}^{(H)}\lbrack j\rbrack}} \\ {{A_{oc}\lbrack j\rbrack}{d_{oc}\lbrack j\rbrack}} \end{bmatrix} + {n\lbrack j\rbrack}}} \\ {= {{{G\lbrack j\rbrack} \times \lbrack j\rbrack} + {n\lbrack j\rbrack}}} \end{matrix} & {{{Eq}.\quad 8}\quad} \end{matrix}$

[0051] where A_(i) ^((L)) and d_(i) ^((L)) are the amplitude and data of the ith low-rate user, respectively; A_(i) ^((H))[j] and d_(i) ^((H))[j] are the amplitude and data of the ith high-rate user in the jth (high-rate) 2^(m) ^(_(H)) -chip subinterval; G[j] is the code matrix of order 2^(m) ^(_(H)) ×(K_(H)+2), with each column containing a different code word; g₂ _(^(m)) _(H) ^((L)) is an arbitrary spread-factor 2^(m) ^(_(H)) seed code that is used to generate the K_(L) spread-factor 2^(m) ^(_(L)) low-rate user codes as in Eq. 1c, (although g₂ _(^(m)) _(H) ^((L)) ∉g₂ _(^(m)) _(H,1) . . . g₂ _(^(m)) _(H,K) _(H) ); the other-cell user code, depends on the subinterval j because this assumes inter-cell users do not enjoy the code property described above; n[j] contains the noise samples over the jth high-rate subinterval. As can be seen, the low-rate users can be modeled as a single effective high-rate user, (which follows from Eq. 1c).

[0052] An alternative way to model the other-cell users that may be useful is to utilize a separate code matrix for each base station. Here, ${G\lbrack j\rbrack} = {\sum\limits_{b}^{numBS}{G_{b}\lbrack j\rbrack}}$

[0053] This approach allows smaller matrices. It is particularly helpful for the chip level processing approaches to be described later, where the cross-terms between code matrices of different base stations can be ignored in the absence of soft-handoff, (because of the structure of the chip level MMSE transform and because the data is likely uncorrelated).

[0054] Note that the model described here directly extends to cases where K_(L)>2^(m) ^(_(L)) ^(-m) ^(_(H)) or where the low-rate user codes do not all share the same seed 2^(m) ^(_(H)) code, (i.e., the low-rate user codes do not share the same root node at the spread-factor 2^(m) ^(_(H)) level of the code tree described in FIG. 2). In this case the low-rate users would simply map to more than one effective high-rate user. Thus, without loss of generality, we can focus here on the case of K_(L)≦2^(m) ^(_(L)) ^(-m) ^(_(H)) with all users deriving from a single high-rate seed code word.

[0055] Matched-Filter Outputs, Symbol Level Processing

[0056] The output of the matched-filter (i.e., correlator) outputs for all users for the jth interval can be expressed as $\begin{matrix} \begin{matrix} {{y\lbrack j\rbrack} = {{G^{\prime}\lbrack j\rbrack}{r\lbrack j\rbrack}}} \\ {= {{{G^{\prime}\lbrack j\rbrack}{G\lbrack j\rbrack} \times \lbrack j\rbrack} + {{G^{\prime}\lbrack j\rbrack}{n\lbrack j\rbrack}}}} \\ {= {{{R\lbrack j\rbrack} \times \lbrack j\rbrack} + {z\lbrack j\rbrack}}} \end{matrix} & {{Eq}.\quad 9} \end{matrix}$

[0057] where G[j] and x[j] are defined in Eq. 8, and R[j]=G′[j]G[j] is the correlation matrix, (which is conjugate symmetric). Again, G′ is the conjugate transpose of G. Eq. 9 provides the soft conventional detector output for the K_(H) high-rate users, the effective high-rate user (representing the collapsed low-rate users), and the other-cell user.

[0058] Multipath

[0059] Another embodiment relates to multipath. The model can easily extend to accommodate multipath channels. Equations 8 and 9 can be modified to define the code matrix G[j]. To incorporate multipath, the code matrix is expressed as $\begin{matrix} {{G\lbrack j\rbrack} = {\sum\limits_{p = 1}^{P}{{C\lbrack j\rbrack}_{p}{W\lbrack j\rbrack}_{p}}}} & {{Eq}.\quad 10} \end{matrix}$

[0060] where W[j]_(P) is a diagonal matrix including the complex channel weights of all users for multipath p in high-rate subinterval j. The columns of C[j]_(P) contain the code vectors shifted vertically according to the relative timing of the path p. In other words, this essentially convolves each code word with the channel impulse response to get a new “equivalent” code word. Note that if all signals originate from the same point, as in the intra-cell cellular downlink, then all users will have the same complex channel weights; in this case W[j] in Eq. 10 will be a scalar.

[0061] Note that this method of handling multipath also applies to any asynchronous user signals, (e.g., other-cell users), where the corresponding code words are simply shifted vertically in its code matrix column according to its relative delay.

[0062] Non-Integer Chip Delays

[0063] The vectors of the above system model were defined based on chip-spaced samples. The model, however, applies equally as well to sub-chip spaced samples. This allows us to model non-integer chip delays between paths or users, as occurs in realistic multipath scenarios. The downside to this approach is that the order of a number of the vectors and matrices increases significantly, which increases computational complexity.

[0064] In order to work with chip-spaced samples while still modeling non-integer chip delays, the code word can be approximated with chip-spaced sample values by straightforward interpolation: $\begin{matrix} {g_{p} = {\sum\limits_{n = {{- N}/2}}^{N/2}{{h_{Int}\left( {n,\theta_{p}} \right)}*w_{p}*g_{p,n}}}} & {{Eq}.\quad 11} \end{matrix}$

[0065] where g_(p) is some code vector corresponding to a single path p, with complex channel weight w_(p); N+1 is the number of taps used in the interpolation; h_(Int)(n,θ_(p)) are the chip-spaced interpolation filter taps sampled (from the underlying sample-spaced interpolation filter) at appropriate sample offset phase θ_(p); g_(p,n) is the g_(p) code vector shifted in time by n chips. Note that the chip-spaced code words can be considered to be the linear sum of several chip-spaced “virtual” paths, delayed and weighted to approximate the underlying non-chip-spaced code word samples.

[0066] Edge Effects

[0067] As previously indicated, reducing the observation interval to one symbol, (possibly even just one high-rate symbol interval) causes degradation in performance, since the overlapping symbols are not totally taken into effect, and the neighboring symbols are completely ignored, (often referred to as “Edge Effects”). This degradation may be particularly experienced where the multipath delay profile is large, and symbols of one path substantially overlap one or more previous/successive symbols of another path. Therefore, the observation interval can be increased to improve performance, and optimize the tradeoff between performance and complexity. The system model described in this section directly extends to a larger observation window, by modifying the code matrix, G[j] and the data vector, x[j] in Eq. 8. For example, if the observation window is extended to take into account one high-rate previous symbol, and one successive high-rate symbol, then the received signal can now be expressed as: $\begin{matrix} \begin{matrix} {{r\lbrack j\rbrack} = {{\begin{bmatrix} \begin{bmatrix} {{G\lbrack j\rbrack}\left( {- 1} \right)} \\ \quad \end{bmatrix} & \quad & 0 \\ \quad & \begin{bmatrix} {{G\lbrack j\rbrack}(0)} \\ \quad \end{bmatrix} & \quad \\ 0 & \quad & \begin{bmatrix} {{G\lbrack j\rbrack}\left( {+ 1} \right)} \\ \quad \end{bmatrix} \end{bmatrix}\begin{bmatrix} {{x\lbrack j\rbrack}\left( {- 1} \right)} \\ {{x\lbrack j\rbrack}(0)} \\ {{x\lbrack j\rbrack}\left( {+ 1} \right)} \end{bmatrix}} + {n\lbrack j\rbrack}}} \\ {= {{{G\lbrack j\rbrack} \times \lbrack j\rbrack} + {n\lbrack j\rbrack}}} \end{matrix} & {{Eq}.\quad 12} \end{matrix}$

 =G[j]x[j]+n[j]  Eq. 12

[0068] where G[j](−1), G[j](0), and G[j](+1) contain the code waveforms corresponding to the observation window intervals previous to the desired symbol interval, equal to the desired symbol interval, and successive to the desired symbol interval, respectively. Note that the code vectors in the columns of G[j](−1) and G[j](+1) do not necessarily extend over a whole symbol interval—the extension of the observation interval window in each direction does not need to be done in integer-symbol increments.

[0069] Higher Rate Users

[0070] The model up until now has been described such that there are no users at a higher-rate than the rate used to establish the processing interval. However, the model can easily be extended to accommodate higher-rate users as well. For example, assume that the high-rate processing interval is 2^(m) ^(_(H)) chips, but that there is a higher-rate user with symbol interval equal to 2^(m) ^(_(H2)) where 2^(m) ^(_(H2)) =2^(m) ^(_(H)) /N, (i.e., with symbol rate N times higher, or equivalently, symbol interval N times smaller). Incorporating this higher-rate user into the model of Eq. 8 would simply mean adding N columns to G[j], (with each successive higher-rate code word shifted down by 2^(m) ^(_(H2)) chips): $\left. {{G\lbrack j\rbrack} = \begin{bmatrix} g_{2^{m_{H}}}^{(L)} & g_{2^{m_{H}},1} & g_{2^{m_{H}},2} & \cdots & g_{2^{m_{H}},K_{H}} & {g_{oc}\lbrack j\rbrack} & \begin{bmatrix} g_{2^{m_{H}},1} \\ 0 \\ \vdots \\ \quad \end{bmatrix} & \begin{bmatrix} 0 \\ g_{2^{m_{H}},2} \\ 0 \\ {\vdots \quad} \end{bmatrix} & ⋰ & \left\lbrack \begin{matrix} \quad \\ \vdots \\ 0 \\ g_{2^{m_{H2}},N} \end{matrix} \right. \end{bmatrix}} \right\rbrack$

[0071] and an additional N values in x[j] corresponding to the N higher-rate symbols that appear in high-rate processing interval.

[0072]FIGS. 4A and 4B show an aspect of another detector 50. FIG. 4A shows a representation of an exemplary multirate system in which two low rate users 40 a-40 b are collapsed into an effective high rate user 41. The system also includes one actual high rate user 42. The exemplary system is limited to three users merely to improve the clarity of the description of the detector 50. The detector 50 is not limited to any number of low-rate users and high-rate users. The low rate users 40 a-40 beach may have a spreading factor of 4, while the actual high rate user 42 has a spreading factor of 2. The symbol time of each of the low rate users 40 a-40 b is T₀, and the symbol time of the high rate user 42 is T₀/2.

[0073]FIG. 4B shows an aspect of the detector 50. A high-rate user may be detected by applying a form of the MMSE criterion to the jth high-rate subinterval, (i.e., a “high-rate” MMSE detector). Both symbol level processing and chip level processing may be applied for detecting users. For symbol level processing, the detector may include a high rate detector 52 to generate soft outputs from the received signal. An MMSE detector 54 operates as the second stage and a linear detector 56 as the third stage. The MMSE detector 54 applies a linear transformation to the soft outputs for a single high-rate symbol interval to decouple the actual and effective high rate users, deriving improved soft symbol outputs for each high rate user. Each of the actual high rate user outputs of the MMSE detector 54 represent soft outputs of the detected data corresponding to actual high rate user. The effective high rate user outputs of the MMSE detector 54 represent a combination of the underlying collapsed low-rate users.

[0074] For chip level processing, the detector 50 may not include the high rate detector 52. Instead, the MMSE detector 54 applies the MMSE linear transformation directly to the input signal.

[0075] High Rate User Symbol Level Processing

[0076] An MMSE linear transformation may be applied to the conventional detector soft symbol outputs in order to derive improved soft symbol outputs for each user. The MMSE linear transformation for each subinterval, L[j], to apply is derived by minimizing the MSE

E|x[j]−L[j]y[j]| ²  Eq. 13

[0077] The following derivation omits the reference to the subinterval. $\begin{matrix} \begin{matrix} {E{{x - {{Ly}{^{2}{= {E{{\left( {x - {Ly}} \right)^{\prime}\left( {x - {Ly}} \right)}}}}}}}}} \\ {= {E{{\left( {{x^{\prime}\left( {I - {R^{\prime}L^{\prime}}} \right)} - {n^{\prime}{GL}^{\prime}}} \right)\left( {{\left( {I - {LR}} \right)x} - {{LG}^{\prime}n}} \right)}}}} \\ {= {E{\left( {{{x^{\prime}\left( {I - {RL}^{\prime}} \right)}\left( {I - {LR}} \right)x} + {n^{\prime}{GL}^{\prime}{LG}^{\prime}n}} \right)}}} \\ {= {{Tr}\left\lbrack {{\left( {I - {RL}^{\prime}} \right)\left( {I - {LR}} \right)\overset{\_}{{xx}^{\prime}}} + {\sigma^{2}{GL}^{\prime}{LG}^{\prime}}} \right\rbrack}} \\ {= {{Tr}\left\lbrack {I + {{RL}^{\prime}{LRP}} - {{RL}^{\prime}P} - {LRP} + {\sigma^{2}{RL}^{\prime}L}} \right\rbrack}} \end{matrix} & {{Eq}.\quad 14} \end{matrix}$

[0078] where both E(.) and the over-bar refer to the expectation operation, and Tr(.) refers to the trace (of a matrix). Minimizing the above expression with respect to L[j] yields:

L[j]=(R[j]+σ ² P[j] ⁻¹)⁻¹  Eq. 15

[0079] where P[j] is a diagonal matrix of powers that can be shown to be $\begin{matrix} \begin{matrix} {{P\lbrack j\rbrack} = {E\left( {{x\lbrack j\rbrack}{x\lbrack j\rbrack}^{\prime}} \right)}} \\ {= {{diag}\left( {\sum\limits_{i = 1}^{K_{L}}{{A_{i}^{(L)}}^{2}\quad {{A_{i}^{(H)}\lbrack j\rbrack}}^{2}\quad {{A_{2}^{(H)}\lbrack j\rbrack}}^{2}\quad \cdots}}\quad \right.}} \\ \left. {~~~~~~~~~~~~~~~~~~~~~~~~~~~}{{{A_{K_{H}}^{(H)}\lbrack j\rbrack}}^{2}\quad {{A_{oc}\lbrack j\rbrack}}^{2}} \right) \end{matrix} & {{Eq}.\quad 16} \end{matrix}$

[0080] Implicit in the above equation is the assumption that all entries of x[j] are uncorrelated, (i.e., the data of all users are uncorrelated with each other). This assumption leads to the diagonal character of the matrix P[j]. This assumption is not true, however, in a number of cases: (1) If soft handoff users exist between base stations, then some of the data streams are identical, or (2) If the processing interval extends longer than a single high-rate symbol then the low-rate user data will be identical for the multiple high-rate subintervals. We may extend the processing interval to be longer than a single high-rate symbol interval in order to take into account edge effects, or we may simply do so to take into account multipath delay spread that causes the high-rate symbols to extend and overlap with one another. In these cases, some of the entries in x[j] may be correlated with one another and thus, P[j] may no longer be a diagonal matrix. As an example, we consider that the observation interval takes into account at least part of one previous symbol and one successive symbol, (but no soft-handoff). Here, Eqs. 12 and 16, can be rewritten as: $\begin{matrix} {{P\lbrack j\rbrack} = \begin{bmatrix} \overset{\_}{{x\lbrack j\rbrack}\left( {- 1} \right){x\lbrack j\rbrack}\left( {- 1} \right)^{\prime}} & \overset{\_}{{x\lbrack j\rbrack}\left( {- 1} \right){x\lbrack j\rbrack}(0)^{\prime}} & \overset{\_}{{x\lbrack j\rbrack}\left( {- 1} \right){x\lbrack j\rbrack}\left( {+ 1} \right)^{\prime}} \\ \overset{\_}{{x\lbrack j\rbrack}(0){x\lbrack j\rbrack}\left( {- 1} \right)^{\prime}} & \overset{\_}{{x\lbrack j\rbrack}(0){x\lbrack j\rbrack}(0)^{\prime}} & \overset{\_}{{x\lbrack j\rbrack}(0){x\lbrack j\rbrack}\left( {+ 1} \right)^{\prime}} \\ \overset{\_}{{x\lbrack j\rbrack}\left( {+ 1} \right){x\lbrack j\rbrack}\left( {- 1} \right)^{\prime}} & \overset{\_}{{x\lbrack j\rbrack}\left( {+ 1} \right){x\lbrack j\rbrack}(0)^{\prime}} & \overset{\_}{{x\lbrack j\rbrack}\left( {+ 1} \right){x\lbrack j\rbrack}\left( {+ 1} \right)^{\prime}} \end{bmatrix}} & {{Eq}.\quad 17} \end{matrix}$

[0081] The diagonal elements of P[j] will be: $\begin{matrix} {{{{Diagonal}\quad {Elements}} = \begin{bmatrix} {\sum\limits_{i = 1}^{K_{L}}{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {- 1} \right)}}^{2}} \\ {{{A_{i}^{(H)}\lbrack j\rbrack}\left( {- 1} \right)}}^{2} \\ \vdots \\ {{{A_{K_{H}}^{(H)}\lbrack j\rbrack}\left( {- 1} \right)}}^{2} \\ {{{A_{oc}\lbrack j\rbrack}\left( {- 1} \right)}}^{2} \\ {\sum\limits_{i = 1}^{K_{L}}{{A_{i}^{(L)}(0)}}^{2}} \\ {{{A_{1}^{(H)}\lbrack j\rbrack}(0)}}^{2} \\ \vdots \\ {{{A_{K_{H}}^{(H)}\lbrack j\rbrack}(0)}}^{2} \\ {{{A_{oc}\lbrack j\rbrack}(0)}}^{2} \\ {\sum\limits_{i = 1}^{K_{L}}{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {+ 1} \right)}}^{2}} \\ {{{A_{1}^{(H)}\lbrack j\rbrack}\left( {+ 1} \right)}}^{2} \\ \vdots \\ {{{A_{K_{H}}^{(H)}\lbrack j\rbrack}\left( {+ 1} \right)}}^{2} \\ {{{A_{oc}\lbrack j\rbrack}\left( {+ 1} \right)}}^{2} \end{bmatrix}}{{{{d_{i}^{(L)}\lbrack j\rbrack}\left( {- 1} \right)} = {d_{i}^{(L)}(0)}},{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {- 1} \right)} = {A_{i}^{(L)}(0)}},{{{for}\quad j} = 2},3,{\ldots \quad 2^{m_{L} - m_{H}}}}{where}{{{{d_{i}^{(L)}\lbrack j\rbrack}\left( {+ 1} \right)} = {d_{i}^{(L)}(0)}},{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {+ 1} \right)} = {A_{i}^{(L)}(0)}},{{{for}\quad j} = 1},2,3,{{\ldots \quad 2^{m_{L} - m_{H}}} - 1}}} & {{Eq}.\quad 18} \end{matrix}$

[0082] and the off-diagonal elements are all zero except for the following: $\begin{matrix} \begin{matrix} {{{{for}\quad j} = 2},3,\ldots \quad,{2^{m_{L} - m_{H}}:}} \\ {\overset{\_}{{x\lbrack j\rbrack}\left( {- 1} \right)_{1}{x\lbrack j\rbrack}(0)_{1}^{*}} = {\overset{\_}{{x\lbrack j\rbrack}(0)_{1}{x\lbrack j\rbrack}\left( {- 1} \right)_{1}^{*}} = {\sum\limits_{i}^{\quad K_{L}}{{{A_{i}^{(L)}(0)}}^{2}H_{K_{L},i,j}^{\prime}H_{K_{L},i,{j - 1}}^{\prime}}}}} \\ {{{{for}\quad j} = 1},2,3,\ldots \quad,{{2^{m_{L} - m_{H}} - 1}:}} \\ {\overset{\_}{{x\lbrack j\rbrack}(0)_{1}{x\lbrack j\rbrack}\left( {+ 1} \right)_{1}^{*}} = {\overset{\_}{{x\lbrack j\rbrack}\left( {+ 1} \right)_{1}{x\lbrack j\rbrack}(0)_{1}^{*}} = {\sum\limits_{i}^{\quad K_{L}}{{{A_{i}^{(L)}(0)}}^{2}H_{K_{L},i,j}^{\prime}H_{K_{L},i,{j + 1}}^{\prime}}}}} \\ {{{{for}\quad j} = 2},3,\ldots \quad,{{2^{m_{L} - m_{H}} - 1}:}} \\ {\overset{\_}{{x\lbrack j\rbrack}\left( {- 1} \right)_{1}{x\lbrack j\rbrack}\left( {+ 1} \right)_{1}^{*}} = {\overset{\_}{{x\lbrack j\rbrack}\left( {+ 1} \right)_{1}{x\lbrack j\rbrack}\left( {- 1} \right)_{1}^{*}} = {\sum\limits_{i}^{\quad K_{L}}{{{A_{i}^{(L)}(0)}}^{2}H_{K_{L},i,{j - 1}}^{\prime}H_{K_{L},i,{j + 1}}^{\prime}}}}} \end{matrix} & {{Eq}.\quad 19} \end{matrix}$

[0083] where x[j](−1)₁, x[j](0)₁, x[j](+1)₁ are the first elements of the vectors implicitly defined in Eq. 12, and which contain the effective high-rate user data, (for the collapsed low-rate users) for the previous, current, and successive high-rate symbol subintervals, respectively.

[0084] The solution to Eq. 13 can also be derived from the classic form of MMSE solutions, as shown below. Once again, temporarily the reference to the subinterval is dropped. Thus, the solution to the minimization of E|x−Ly|² where y=Rx+z, is: $\begin{matrix} {{L^{\prime} = {{E\left\lbrack {yy}^{\prime} \right\rbrack}^{- 1}{E\left\lbrack {yx}^{\prime} \right\rbrack}}}{where}} & {{Eq}.\quad 20} \\ {{E\left\lbrack {yy}^{\prime} \right\rbrack} = {{{R\quad \overset{\_}{{xx}^{\prime}}R} + \overset{\_}{{zz}^{\prime}}} = {{RPR} + {\sigma^{2}R}}}} & {{Eq}.\quad 21} \\ {{E\left\lbrack {yx}^{\prime} \right\rbrack} = {{R\quad \overset{\_}{{xx}^{\prime}}} = {RP}}} & {{Eq}.\quad 22} \end{matrix}$

[0085] where {overscore (xx′)} is given in Equation 16 when considering only one symbol, (no edge effects), and Eqs. 17-19, when taking 3 symbols into account, (fully or partially).

[0086] Note that for the high-rate users, minimizing the cost function E|x−Ly|² (as in Eq. 13) gives the same result as minimizing the cost function E|d−Ly|², since the high-rate user entries in x are decoupled from other users. This may not be the case, however, for low-rate users, (where a number of low-rate users are combined into a single entry in x); thus, the latter cost function will be used later when addressing detection of the low-rate users.

[0087] High Rate User Chip Level Processing

[0088] A MMSE linear transformation may be applied directly to the received signal, without the front-end conventional detector. Here the linear transformation, v[j], is derived that minimizes the following quantity.

E|d _(i) ^((H)) [j]−b[j]′r[j]| ²  Eq. 23

[0089] The solution to this can be shown to be: $\begin{matrix} \begin{matrix} {{v\lbrack j\rbrack} = {\left( {E\left\lbrack {{r\lbrack j\rbrack}{r\lbrack j\rbrack}^{\prime}} \right\rbrack} \right)^{- 1}{E\left\lbrack {{r\lbrack j\rbrack}{d_{i}^{H}\lbrack j\rbrack}^{*}} \right\rbrack}}} \\ {= {\left( {{{G\lbrack j\rbrack}{P\lbrack j\rbrack}{G^{\prime}\lbrack j\rbrack}} + {\sigma^{2}I}} \right)^{- 1}{A_{i}^{(H)}\lbrack j\rbrack}g_{2^{m_{H}},1}}} \end{matrix} & {{Eq}.\quad 24} \end{matrix}$

[0090] Note that if taking into account neighbor symbols (fully or partially), then P[j] in Eq. 24 above is defined according to Equations 17-19.

[0091]FIG. 5 shows a flow chart of the operation of detector 50. Starting at block 60, a signal that is modulated by a spreading code such as in a CDMA system is received. The signal includes actual high-rate users and low-rate users. Continuing on to block 62, the signal is decoded using the high symbol rate for the low-rate users as well as the high-rate users. The low-rate users are collapsed (i.e. modeled as) into one or more effective high-rate users. At block 64, soft outputs may be detected for the actual high-rate users and the effective high-rate users, (for the case of symbol-level processing). Continuing on to block 66, an MMSE linear transformation is applied to the soft outputs for a high-rate symbol interval to decouple the actual and effective high rate users generating soft outputs. The resulting decoupled actual high rate user soft outputs represent the detected data of the corresponding actual high rate users. The decoupled effective high rate user soft outputs represent a combination of the underlying collapsed low-rate users. Finishing at block 68, a linear transformation may be applied over successive intervals of the effective high-rate user soft outputs to decouple the low-rate users embedded in the effective high-rate user soft outputs. For the case of chip-level processing, an MMSE linear transformation 66 would be applied directly to the received signal, bypassing the initial detector 64.

[0092] Low Rate User Symbol Level Processing

[0093] Another embodiment uses techniques for recovering the low-rate users from the soft outputs of the high-rate front-end conventional correlator (matched-filter) detector for all users. Instead of one MMSE processing window over the entire low-rate symbol interval, (1) the MMSE processing is done over several separate smaller windows, (2) and used to obtain an MMSE estimate for the low-rate user for each processing sub-interval, (3) these estimates are combined for the low-rate user in some way. In other words, we can take the 2^(m) ^(_(L)) ^(-m) ^(_(H)) outputs from the high-rate MMSE processing for the low-rate users and combine them in some way to get an estimate of the low-rate user. The outputs from the high-rate MMSE processing for the low-rate users follow from the minimization of the cost function

E|d _(i) ^((L)) −L[j]y[j]|²

[0094] Thus, we can write (dropping the reference to the jth subinterval for convenience) $\begin{matrix} {L^{\prime} = {{E\left\lbrack {yy}^{\prime} \right\rbrack}^{- 1}{E\left\lbrack {yd}_{i}^{{(L)}^{*}} \right\rbrack}}} \\ {= {\left( {{RP} + {\sigma^{2}I}} \right)^{- 1}p}} \end{matrix}$ where $\begin{matrix} {{E\left\lbrack {yy}^{\prime} \right\rbrack} = {{{R\overset{\_}{\quad {xx}^{\prime}}R} + \overset{\_}{{zz}^{\prime}}} = {{RPR} + {\sigma^{2}R}}}} \\ {{E\left\lbrack {yd}_{i}^{{(L)}^{*}} \right\rbrack} = {{R\quad \overset{\_}{{xd}_{i}^{{(L)}^{*}}}} = {Rp}}} \end{matrix}$

[0095] and where p is a vector such that the only non-zero entries in p correspond to the effective high-rate users in x, and the value of these non-zero entries are equal to A_(i) ^((L))H′_(k) _(L) _(i,j). For example, if the high-rate processing window takes into account 3 high-rate symbols then x[j]=[x[j](−1)^(T) x[j](0)^(T) x[j](+1)^(T)]^(T) and we have (from Eq. 8)

P[j]=└A _(i) ^((L)) H′ _(K) _(L) _(i,j)0 . . . 0A _(i) ^((L)) H′ _(K) _(L) _(i,j)0 . . . 0A _(i) ^((L)) H′ _(K) _(L) _(i,k)0 . . . 0┘

[0096] for all j except j=1 and j=2^(m) ^(_(L)) ^(-m) ^(_(H)) , where in these two cases, p[j] would have only 2 non-zero entries (the latter two non-zero entries for j=1, and the first two non-zero entries for j=2^(m) ^(_(L)) ^(-m) ^(_(H)) ), since the effective high-rate user for the previous and next low-rate interval is uncorrelated with d_(i) ^((L)) of the current low-rate interval.

[0097] Method 1: Low Rate User Decoupling Combining

[0098] In each of the high-rate MMSE outputs for the low-rate user derived above, part of the low-rate symbol is recovered, i.e., we partly recover an effective high-rate user that represents some combination of the underlying collapsed low-rate users. As described below, these outputs can be combined in some way to decouple and detect the low-rate users. Using this approach allows us to apply MMSE solutions in smaller subintervals, which reduces complexity, while still recovering the low-rate users.

[0099] The output of the high-rate MMSE detector derived above for the effective high-rate user in the jth subinterval can be written as: $\begin{matrix} \begin{matrix} {{y_{e}\lbrack j\rbrack} = {{L_{e}\lbrack j\rbrack}^{T}{y\lbrack j\rbrack}}} \\ {= {{{L_{e}\lbrack j\rbrack}^{T}{R\lbrack j\rbrack}{x\lbrack j\rbrack}} + {{L_{e}\lbrack j\rbrack}^{T}{z\lbrack j\rbrack}}}} \\ {= {{{b_{e}\lbrack j\rbrack}^{T}{x\lbrack j\rbrack}} + {z_{e}\lbrack j\rbrack}}} \end{matrix} & {{Eq}.\quad 25} \end{matrix}$

[0100] where L_(e)[j]^(T) is the row of L[j] corresponding to the effective high-rate user output, (e.g., first row in Eq. 15), and

b _(e) [j]=L _(e) [j] ^(T) R[j]  Eq. 26

[0101] In order to decouple the low-rate users we collect the effective high-rate user outputs for all subintervals in a vector: $\begin{matrix} \begin{matrix} {y_{e} = \left\lbrack {{L_{e}\lbrack 1\rbrack}^{T}{y\lbrack 1\rbrack}\quad {L_{e}\lbrack 2\rbrack}^{T}{y\lbrack 2\rbrack}\quad \cdots \quad {L_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}^{T}\quad {y\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \right\rbrack^{T}} \\ {= \left\lbrack {{y_{e}\lbrack 1\rbrack}\quad {y_{e}\lbrack 2\rbrack}\quad \cdots \quad {y_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \right\rbrack^{T}} \end{matrix} & {{Eq}.\quad 27} \end{matrix}$

[0102] For the case of no edge effects, (only one high-rate symbol considered), and where the first entry in x[j] contains the effective high-rate user (as in Eq. 8) then we can express this as: $\begin{matrix} \begin{matrix} {y_{e} = {\left\lbrack {{b_{e}\lbrack 1\rbrack}_{1}{x\lbrack 1\rbrack}_{1}\quad {b_{e}\lbrack 2\rbrack}_{1}{x\lbrack 2\rbrack}_{1}\quad \cdots \quad {b_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}_{1}{x\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}_{1}} \right\rbrack^{T} +}} \\ {\left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}} \\ {= {{{{diag}\left\lbrack {{b_{e}\lbrack 1\rbrack}_{1}\quad {b_{e}\lbrack 2\rbrack}_{1}\quad \cdots \quad {b_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}_{1}} \right\rbrack}\begin{bmatrix} {x\lbrack 1\rbrack}_{1} \\ {x\lbrack 2\rbrack}_{2} \\ \vdots \\ {x\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}_{1} \end{bmatrix}} +}} \\ {\left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}} \\ {= {{B_{e}x_{e}} + \left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}}} \\ {= {{B_{e}\begin{bmatrix} {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,1}^{\prime}}} \\ {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,2}^{\prime}}} \\ \vdots \\ {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,2^{m_{L} - m_{H}}}^{\prime}}} \end{bmatrix}} + \left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}}} \\ {= {{B_{e}H_{K_{L}}A^{(L)}d^{(L)}} + \left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}}} \end{matrix} & {{Eq}.\quad 28} \end{matrix}$

[0103] where b_(e)[j]₁ and x[j]₁ are the first elements of the b_(e) and x vectors, which corresponds to the effective high-rate user output for the jth interval, and

[0104] H_(K) _(L) a matrix containing K_(L) columns of a Walsh Hadamard transform of order 2^(m) ^(_(L)) ^(-m) ^(_(H)) (as in Eq. 1c), A^((L))=diag(A₁ ^((L)) A₂ ^((L)) . . . A_(K) _(L) ^((L))) is a diagonal matrix containing the amplitudes of the low rate users, d^((L))=[d₁ ^((L)) d₂ ^((L)) . . . d_(K) _(L) ^((L))]^(T) holds the symbols for the K_(L) low-rate users (that collapsed into the effective high-rate user),

[0105] B_(e) is a diagonal matrix of size 2^(m) ^(_(L)) ^(-m) ^(_(H×)) 2^(m) ^(_(L)) ^(-m) ^(_(H)) and is implicitly defined in Eq. 28 above.

[0106] x_(e) is a vector containing the data of the effective high-rate users only (length 2^(m) ^(_(L)) ^(-m) ^(_(H)) ).

[0107] In the case where edge effects are taken into account, then the only thing that changes in Eq. 28 is that B_(e) is no longer diagonal. For example, if we consider 3 high-rate symbols, then similar to Eq. 28 we can write: $\begin{matrix} \begin{matrix} {y_{e} = {\begin{bmatrix} \begin{matrix} \begin{matrix} \begin{matrix} {{{b_{e}\lbrack 1\rbrack}(0)_{1}{x\lbrack 1\rbrack}(0)_{1}} + {{b_{e}\lbrack 1\rbrack}(1)_{1}{x\lbrack 1\rbrack}(1)_{1}}} \\ {{{b_{e}\lbrack 2\rbrack}\left( {- 1} \right)_{1}{x\lbrack 2\rbrack}\left( {- 1} \right)_{1}} + {{b_{e}\lbrack 2\rbrack}(0)_{1}{x\lbrack 2\rbrack}(0)_{1}} +} \end{matrix} \\ {{b_{e}\lbrack 2\rbrack}\left( {+ 1} \right)_{1}{x\lbrack 2\rbrack}\left( {+ 1} \right)_{1}} \end{matrix} \\ \vdots \end{matrix} \\ {{{b_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}\left( {- 1} \right)_{1}{x\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}\left( {- 1} \right)_{1}} +} \\ {{b_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}(0)_{1}{x\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}(0)_{1}} \end{bmatrix} +}} \\ {\left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}} \\ {= \begin{bmatrix} {{b_{e}\lbrack 1\rbrack}(0)_{1}} & {{b_{e}\lbrack 1\rbrack}(1)_{1}} & \quad & \quad & \quad \\ {{b_{e}\lbrack 2\rbrack}\left( {- 1} \right)_{1}} & {{b_{e}\lbrack 2\rbrack}(0)_{1}} & {{b_{e}\lbrack 2\rbrack}\left( {+ 1} \right)_{1}} & \quad & 0 \\ \quad & {{b_{e}\lbrack 3\rbrack}\left( {- 1} \right)_{1}} & {{b_{e}\lbrack 3\rbrack}(0)_{1}} & {{b_{e}\lbrack 3\rbrack}\left( {+ 1} \right)_{1}} & \quad \\ \quad & \quad & \quad & ⋰ & \quad \\ \quad & 0 & \quad & {{b_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}\left( {- 1} \right)_{1}} & {{b_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}(0)_{1}} \end{bmatrix}} \\ {{\begin{bmatrix} {{x\lbrack 1\rbrack}(0)_{1}} \\ {{x\lbrack 2\rbrack}(0)_{1}} \\ \vdots \\ {{x\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}(0)_{1}} \end{bmatrix} + \left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}}} \\ {= {{B_{e}H_{K_{L}}A^{(L)}d^{(L)}} + \left\lbrack {{{Interference}\&}\quad {Noise}} \right\rbrack^{T}}} \end{matrix} & {{Eq}.\quad 29} \end{matrix}$

[0108] where B_(e) is now block-diagonal, and

b _(e) [j]=[b _(e) [j](−1)^(T) b _(e) [j](0)^(T) b _(e) [j](+1)^(T)]^(T)  Eq. 30

y[j]=[j[j](−1)^(T) y[j](0)^(T) y[j](+1)^(T)]^(T),  Eq. 31

[0109] corresponding to

x[j]=[x[j](−1)^(T) x[j])(0)^(T) x[j](+1)^(T)]^(T),  Eq. 32

[0110] as defined in Eq. 12, and where

x[1](0)₁ =x[2](−1)₁ ; x[2](0)₁ =x[1](+1)₁ =x[3](−1)₁, etc.,  Eq. 33

[0111] since the low-rate symbols span 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate symbols. Another assumption is that

y[1](0)₁ =y[2](−1)₁ ; y[2](0)₁ =y[1](+2)₁ =y[31(−1)₁,etc.  Eq. 34

[0112] which means that the received signal samples and the code-words are used over the whole extended symbol window. In other words, if a window of +/− n high-rate symbols is processed at one time, then the received signal is processed over the entire 2n+1 symbol sliding window for each high-rate symbol. Thus, assuming that the processing window takes into account the full neighboring symbols on either side of the desired high-rate symbol being demodulated. As previously described, edge effects can also easily be taken partially into account by processing only a partial amount of the neighboring symbols. Therefore, in order to recover the low-rate users which forms:

y _(L) =H′ _(K) _(L) B _(e) ⁻¹ y _(e)  Eq. 35

[0113] which decouples and recovers the low-rate data from the effective high-rate user outputs.

[0114] We can alternately express all of the above in a much more compact form. Define

y=y[1](−1)^(T) y[1](0)^(T) y[2](0)^(T) . . . y[2^(m) ^(_(L)) ^(-m) ^(_(H)) ](0)^(T) y[2^(m) ^(_(L)) ^(-m) ^(_(H)) ](+1)^(T)]^(T),  Eq. 36

x=[x[1](−1)^(T) x[1](0)^(T) x[2](0)^(T) . . . x[2^(m) ^(_(L)) ^(-m) ^(_(H)) ](0)^(T) x[2^(m) ^(_(L)) ^(-m) ^(_(H)) ](+1)^(T)]^(T)  Eq. 37

[0115] where

y=Rx+z  Eq. 38

[0116] and where R contains the correlations between every pair of high-rate code words over the low-rate symbol interval, and z is the processed noise. If there are K=K_(H)+2 total high-rate users and effective high-rate users, (including one other-cell user), then y is of length (2^(m) ^(_(L)) ^(-m) ^(H)+2)K, (assuming a 3 high-rate symbol processing window, i.e., edge effects). We also define $\begin{matrix} {\Gamma_{e}^{\prime} = \begin{bmatrix} \left\lbrack {L_{e}\lbrack 1\rbrack}^{T} \right\rbrack & \quad & \quad \\ \quad & \left\lbrack {L_{e}\lbrack 2\rbrack}^{T} \right\rbrack & 0 \\ 0 & ⋰ & \quad \\ \quad & \quad & \left\lbrack {L_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}^{T} \right\rbrack \end{bmatrix}} & {{Eq}.\quad 39} \end{matrix}$

[0117] where Γ′_(e) is of dimension 2^(m) ^(_(L)) ^(-m) ^(_(H)) x(2^(m) ^(_(L)) ^(-m) ^(_(H)) +2)K, (each L_(e)[j]^(T) is of length 3K for the 3 symbol window case and shifted over by an additional K elements in each successive row).

[0118] The effective high-rate symbol soft MMSE outputs can be expressed as follows: $\begin{matrix} \begin{matrix} {y_{e} = {\Gamma_{e}^{\prime}y}} \\ {= {{\Gamma_{e}^{\prime}{Rx}} + {\Gamma_{e}^{\prime}z}}} \\ {= {{\Gamma_{e}^{\prime}\left( {{R_{e}x_{e}} + {R_{\sim e}x_{\sim e}}} \right)} + z_{e}}} \\ {= {{\Gamma_{e}^{\prime}R_{e}x_{e}} + {\Gamma_{e}^{\prime}R_{\sim e}x_{\sim e}} + z_{e}}} \\ {= {{B_{e}x_{e}} + {\Gamma_{e}^{\prime}R_{\sim e}x_{\sim e}} + z_{e}}} \end{matrix} & {{Eq}.\quad 40} \end{matrix}$

[0119] where x_(e) is a vector (length 2^(m) ^(_(L)) ^(-m) ^(_(H)) ) which contains the data of the effective high-rate users only (for all 2^(m) ^(_(L)) ^(-m) ^(_(H)) intervals within the low-rate interval being processed); x_(˜e) contains the data of the remaining users; R_(e) is a (2^(m) ^(_(L)) ^(-m) ^(_(H)) +2)Kx2^(m) ^(_(L)) ^(-m) ^(_(H)) correlation matrix, which contain the correlations of all (2^(m) ^(_(L)) ^(-m) ^(_(H)) +2)K code-words with only the 2^(m) ^(_(L)) ^(-m) ^(_(H)) effective high-rate user code-words. R_(˜e) is the correlation matrix for the remaining users; the middle term, Γ′_(e)R_(˜e)x_(˜e), represents the residual interference after the MMSE linear transformation is applied; z_(e) is the post-MMSE processed thermal noise; B_(e) is implicitly defined in the above equation as

B_(e)=Γ′_(e)R_(e)  Eq. 41

[0120] and is a square matrix of order 2^(m) ^(_(L)) ^(-m) ^(_(H)) . As mentioned before, B_(e) will be diagonal in the case when only a single high-rate symbol interval is considered for the high-rate MMSE detection. Also, in the 3-symbol window case, there will be 3*2 ^(m) ^(_(L)) ^(-m) ^(_(H)) −2 non-zero entries, (as is seen in Eq. 29).

[0121] Note that Eq. 40 simply expresses Eq. 28 and Eq. 29 in a more compact form. As we saw in Eq. 28, we can express the effective high-rate user outputs as:

x _(e) =H _(K) _(L) A ^((L)) d ^((L))  Eq. 42

[0122] Therefore, in order to decouple and recover the low-rate users: $\begin{matrix} \begin{matrix} {y_{L} = {H_{K_{L}}^{\prime}B_{e}^{- 1}\Gamma_{e}^{\prime}y}} \\ {= {H_{K_{L}}^{\prime}B_{e}^{- 1}y_{e}}} \end{matrix} & {{Eq}.\quad 43} \end{matrix}$

[0123] Low Rate User General Decoupling Combining

[0124] Based on the above discussion, a general form of decoupling combining (to recover the low-rate user symbol from the effective high-rate user symbol estimates) can be defined where the initial high-rate processing is done by some general linear transformation, namely: $\begin{matrix} \begin{matrix} {y_{L} = {{H_{K_{L}}^{\prime}\left( {LR}_{e} \right)}^{- 1}{Ly}}} \\ {= {{H_{K_{L}}^{\prime}\left( {LR}_{e} \right)}^{- 1}y_{e}}} \end{matrix} & {{{Eq}.\quad 43}a} \end{matrix}$

[0125] where L is some linear transform of dimensions 2^(m) ^(_(L)) ^(-m) ^(_(H)) ×(2^(m) ^(_(L)) ^(-m) ^(_(H)) +2)K, (for the 3-symbol window case), y_(e)=Ly provides estimates of the effective high-rate user symbols, and R_(e) (dimensions (2^(m) ^(_(L)) ^(-m) ^(_(H)) +2)Kx2^(m) ^(_(L)) ^(-m) ^(_(H)) ) was defined implicitly in Eq. 40: $\begin{matrix} \begin{matrix} {y = {{Rx} + z}} \\ {= {{R_{e}x_{e}} + {R_{\sim e}x_{\sim e}} + z}} \end{matrix} & {{{Eq}.\quad 43}b} \end{matrix}$

[0126] The application of (LR_(e))⁻¹L to y is guaranteed to decouple the effective high-rate symbols, x_(e), and the subsequent application of H′_(K) _(L) will combine the effective high-rate data values in such a way as to recover the low-rate data. Several special cases can be envisioned:

[0127] 1. L is all zeros except for the 2^(m) ^(_(L)) ^(-m) ^(_(H)) columns of the identity matrix I₂ _(^(m)) _(L) _(^(-m)) _(H) that are distributed in L according to the ordering of the effective high-rate users. This is equivalent to only utilizing the 2^(m) ^(_(L)) ^(-m) ^(_(H)) effective high-rate conventional detector outputs of y, treating all other user signals as noise, and decorrelating only the effective high-rate users. In the presence of significant interference from other users (i.e., the non-effective high-rate users) the performance of this detector will be poor.

[0128] 2. $\underset{\_}{L = R_{e}^{\prime}}.$

[0129] This is equivalent to applying the generalized inverse of R_(e) to y to decouple the effective high-rate symbols x_(e).

[0130] 3. $\underset{\_}{L = \Gamma_{e}^{\prime}},$

[0131] as discussed above (e.g., Eq. 43), where the rows of Γ′_(e) contain the high-rate MMSE solutions for the effective high-rate user outputs, (Eq. 39).

[0132] 4. L can be chosen to minimize $\underset{\_}{E{{x_{e} - {\left( {LR}_{e} \right)^{- 1}{Ly}}}}^{2}}$

[0133] Method 2: Low Rate User MMSE Combining

[0134] The technique described previously applied a weight vector to y_(e), (containing outputs for the effective high-rate user for each interval, see Eq. 43), to decouple or “decorrelate” the low rate users. In this section, we attempt to derive a weight vector that when applied to y_(e) would minimize the following MSE $\begin{matrix} {E\left( {{d_{k}^{(L)} - {w^{\prime}y_{e}}}}^{2} \right)} & {{Eq}.\quad 44} \end{matrix}$

[0135] to solve for the kth low-rate user's symbol. The solution to this is $\begin{matrix} {w = {\left( \overset{\_}{y_{e}y_{e}^{\prime}} \right)^{- 1}\left( \overset{\_}{y_{e}d_{k}^{{(L)}^{*}}} \right)}} & {{Eq}.\quad 45} \end{matrix}$

[0136] where, based on Eq. 40, $\begin{matrix} {\overset{\_}{y_{e}y_{e}^{\prime}} = {\Gamma_{e}^{\prime}\overset{\_}{{yy}^{\prime}}\Gamma_{e}}} & {{Eq}.\quad 46} \\ {\overset{\_}{y_{e}d_{k}^{{(L)}^{*}}} = {\Gamma_{e}^{\prime}\overset{\_}{{yd}_{k}^{{(L)}^{*}}}}} & {{Eq}.\quad 47} \end{matrix}$

[0137] where y and x are defined in Eqs. 36 and 37, respectively, and {overscore (yy′)} is defined according to Equation 21, with

P_(xx)={overscore (xx′)}  Eq. 48

[0138] The elements of P_(xx) are easily expressed based on the following. The auto-correlations can be written as $\begin{matrix} {{E\left( {{x\lbrack j\rbrack}(0){x\lbrack j\rbrack}(0)^{\prime}} \right)} = {{diag}\left( {\sum\limits_{i = 1}^{K_{L}}{{A_{i}^{(L)}}^{2}{{A_{1}^{(H)}\lbrack j\rbrack}}^{2}{{A_{2}^{(H)}\lbrack j\rbrack}}^{2}\cdots \quad {{A_{K_{H}}^{(H)}\lbrack j\rbrack}}^{2}{{A_{oc}\lbrack j\rbrack}}^{2}}} \right)}} & {{Eq}.\quad 49} \end{matrix}$

[0139] and the cross-correlations $\begin{matrix} {{E\left( {{x\lbrack j\rbrack}(0){x\lbrack k\rbrack}(0)^{\prime}} \right)} = {{{{diag}\left( {\sum\limits_{i = 1}^{K_{L}}{{A_{i}^{(L)}}^{2}H_{K_{L},i,j}^{\prime}\quad H_{K_{L},i,j}^{\prime}\quad 0\quad 0\quad \cdots \quad 0\quad 0}} \right)}\quad j} \neq k}} & {{Eq}.\quad 50} \end{matrix}$

[0140] The auto-correlations involving x[1](−1) or x[2^(m) ^(_(L)) ^(-m) ^(_(H)) ](+1) have the same form as Eq. 49, except A_(i) ^((L)) changes according to the low-rate amplitude values for the previous and successive low-rate symbols, respectively; the cross-correlations involving these terms are all zero.

[0141] The term $\overset{\_}{{yd}_{k}^{{(L)}^{*}}}$

[0142] can be expressed as $\begin{matrix} {\overset{\_}{{yd}_{k}^{{(L)}^{*}}} = {{R\quad \overset{\_}{{xd}_{k}^{{(L)}^{*}}}} = {RP}_{xd}}} & {{Eq}.\quad 51} \end{matrix}$

[0143] where P_(xd) is a vector of all zeros except for 2^(m) ^(_(L)) ^(-m) ^(_(H)) nonzero entries corresponding to ${\overset{\_}{{x\lbrack j\rbrack}_{1}d_{k}^{{(L)}^{*}}} = {{A_{k}^{(L)}H_{K_{L},i,j}^{\prime}\quad j} = 1}},2,\ldots \quad,{2^{m_{L} - m_{H}}.}$

[0144] Effectively $\begin{matrix} \begin{matrix} {w = {\left( {{\Gamma_{e}^{\prime}{RP}_{xx}R\quad \Gamma_{e}} + {\sigma^{2}\Gamma_{e}^{\prime}R\quad \Gamma_{e}}} \right)^{- 1}\Gamma_{e}^{\prime}{RP}_{xd}}} \\ {= {\left\lbrack {{\Gamma_{e}^{\prime}\left( {{{RP}_{xx}R} + {\sigma^{2}R}} \right)}\Gamma_{e}} \right\rbrack^{- 1}\Gamma_{e}^{\prime}{RP}_{xd}}} \end{matrix} & {{Eq}.\quad 52} \end{matrix}$

[0145] Note that there are only 2^(m) ^(_(L)) ^(-m) ^(_(H)) nonzero entries in P_(xd) which serves to pick out from the full MMSE combining matrix (that would recover all x) the 2^(m) ^(_(L)) ^(-m)rows that correspond to the effective high-rate user symbols, (in order to recover one of the low-rate user symbols embedded in all of the effective high-rate user symbols).

[0146] Preprocessing over the Low-Rate Interval

[0147]FIG. 6A shows a representation of another multirate system in which two low rate users 70 a-70 b are collapsed into an effective high rate user 71. The system also includes one actual high rate user 72. The low rate users 30 a-70 b each may have a spreading factor of 4, while the actual high rate user 72 has a spreading factor of 2. The symbol time of each of the low rate users 70 a-70 b is T_(o), and the symbol time of the actual high rate user 72 is T_(o)/2.

[0148] Referring to FIG. 6B, the detector 80 includes a high rate detector 82 similar in operation and function to high rate detectors 32 and 52. Similarly, the high rate detector 82 generates soft outputs for the actual high-rate users and the effective high-rate users. The detector 80 includes a linear detector 84 as the second stage and an MMSE detector 86 as the third stage. The linear detector 84 may post-multiply the soft outputs of the high rate detector 82 (over the whole low-rate symbol interval) to generate transformed effective high-rate user soft outputs and transformed actual high-rate user soft outputs. The multiple low-rate users appear as multiple decoupled high-rate symbols while still being coupled to the actual high rate users. The MMSE detector 86 may apply a linear transformation to the soft outputs of the second stage linear detector over one high-rate interval to decouple a low rate user (i.e. transformed effective high-rate symbol) from the actual high rate users. For chip-level processing (described later), the detector 80 will not include the high-rate detector 82. Instead, the preprocessing decoupling transformation 84 is applied directly to the input received signal.

[0149] The (symbol-level) preprocessing method just described transforms the matched-filter outputs over the 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate intervals to a new set of outputs for K_(L) transformed intervals. The transformed outputs decouple the low-rate users, which overlap and extend over the 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate intervals, into separate distinct K_(L) pseudo-high-rate intervals; in the process, the high-rate users are transformed into low-rate users, which can be modeled as “effective” high-rate users, as previously described, (FIG. 6A). This initial transformation enables us to apply a single high-rate linear transform over a single high-rate interval, thus, significantly reducing complexity, (FIG. 6B). Recall that Method 1 and Method 2 of the previous sub-sections, entailed computing an MMSE solution for each high-rate interval, with post-processing combining of these multiple MMSE high-rate outputs to get an estimate for a low-rate symbol. Here, the preprocessing enables the detection to consist of a single high-rate MMSE transform, with no post-processing combining necessary.

[0150] This embodiment describes MMSE detection, as we have done elsewhere in the report. Other linear transformations can be applied as well to the post-transformed pseudo-high-rate intervals to recover the low-rate users.

[0151] Note that the approach described here requires that the code words for each user repeat (to within a sign change) every high-rate interval, a property that is satisfied by the spreading codes introduced earlier. This will generally not be the case in commercial systems since the transmissions from different cells are mixed with unique very long codes spanning many symbols. (One cell can be processed by first stripping off the long code.) As such, the other-cell user will not be discussed in this section. For systems where the other-cell users' code-words do repeat every high-rate interval (to within a sign change), then they could easily be included in the processing. Note that even if only intra-cell signals are processed, this low complexity method will provide better performance than a standard MMSE chip equalizer.

[0152] We can arrange the conventional detector outputs for the 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate intervals as follows, (assuming a single symbol window, i.e., no edge effects): $\begin{matrix} \begin{matrix} {Y = \left\lfloor {{y\lbrack 1\rbrack}\quad {y\lbrack 2\rbrack}\quad \cdots \quad {y\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \right\rfloor} \\ {= {{R\left\lbrack {{x\lbrack 1\rbrack}\quad {x\lbrack 2\rbrack}\quad \cdots \quad {x\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \right\rbrack} + \left\lbrack {{z\lbrack 1\rbrack}\quad {z\lbrack 2\rbrack}\quad \cdots \quad {z\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \right\rbrack}} \\ {= {{R\begin{bmatrix} {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,1}^{\prime}}} & {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,2}^{\prime}}} & \cdots & {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,2^{m_{L} - m_{H}}}^{\prime}}} \\ {{A_{1}^{(H)}\lbrack 1\rbrack}{d_{1}^{(H)}\lbrack 1\rbrack}} & {{A_{1}^{(H)}\lbrack 2\rbrack}{d_{1}^{(H)}\lbrack 2\rbrack}} & \cdots & {{A_{1}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}{d_{1}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \\ {{A_{2}^{(H)}\lbrack 1\rbrack}{d_{2}^{(H)}\lbrack 1\rbrack}} & {{A_{2}^{(H)}\lbrack 2\rbrack}{d_{2}^{(H)}\lbrack 2\rbrack}} & \cdots & {{A_{2}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}{d_{2}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \\ \vdots & \vdots & ⋰ & \vdots \\ {{A_{K_{H}}^{(H)}\lbrack 1\rbrack}{d_{K_{H}}^{(H)}\lbrack 1\rbrack}} & {{A_{K_{H}}^{(H)}\lbrack 2\rbrack}{d_{K_{H}}^{(H)}\lbrack 2\rbrack}} & \cdots & {{A_{K_{H}}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}{d_{K_{H}}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \end{bmatrix}} + Z}} \\ {= {{RX} + Z}} \end{matrix} & {{Eq}.\quad 53} \end{matrix}$

[0153] Note that R (square matrix of order K, with K=K_(H)+1) does not depend on the interval, because of the assumption, (stated above), that all the code words repeat (to within a sign change) every high-rate interval. The first row of the matrix X can be expressed as follows: $\begin{matrix} {\left\lbrack {A_{1}^{(L)}d_{1}^{(L)}\quad A_{2}^{(L)}d_{2}^{(L)}\quad \cdots \quad A_{K_{L}}^{(L)}d_{K_{L}}^{(L)}} \right\rbrack H_{K_{L}}^{\prime}} & {{Eq}.\quad 54} \end{matrix}$

[0154] where H_(K) _(L) (defined earlier), is a 2^(m) ^(_(L)) ^(-m) ^(_(H)) ×K_(L) matrix with K_(L) columns of the Walsh-Hadamard matrix of order 2^(m) ^(_(L)) ^(-m) ^(_(H)) . These 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate interval outputs can be transformed into K_(L) transformed interval outputs as follows: $\begin{matrix} \begin{matrix} {Y_{T} = {YH}_{K_{L}}} \\ {= \left\lbrack {{y_{T}\lbrack 1\rbrack}\quad {y_{T}\lbrack 2\rbrack}\quad \cdots \quad {y_{T}\left\lbrack K_{L} \right\rbrack}} \right\rbrack} \\ {= {{R\left\lbrack {{x_{T}\lbrack 1\rbrack}\quad {x_{T}\lbrack 2\rbrack}\quad \cdots \quad {x_{T}\left\lbrack K_{L} \right\rbrack}} \right\rbrack} + \left\lbrack {{z_{T}\lbrack 1\rbrack}\quad {z_{T}\lbrack 2\rbrack}\quad \cdots \quad {z_{T}\left\lbrack K_{L} \right\rbrack}} \right\rbrack}} \\ {= {{R\begin{bmatrix} {2^{m_{L} - m_{H}}A_{1}^{(L)}d_{1}^{(L)}} & {2^{m_{L} - m_{H}}A_{2}^{(L)}d_{2}^{(L)}} & \cdots & {2^{m_{L} - m_{H}}A_{K_{L}}^{(L)}d_{K_{L}}^{(L)}} \\ {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{1}^{(H)}\lbrack i\rbrack}{d_{1}^{(H)}\lbrack i\rbrack}H_{K_{L},i,1}}} & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{1}^{(H)}\lbrack i\rbrack}{d_{1}^{(H)}\lbrack i\rbrack}H_{K_{L},i,2}}} & \cdots & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{1}^{(H)}\lbrack i\rbrack}{d_{1}^{(H)}\lbrack i\rbrack}H_{K_{L},i,K_{L}}}} \\ {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{2}^{(H)}\lbrack i\rbrack}{d_{2}^{(H)}\lbrack i\rbrack}H_{K_{L},i,1}}} & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{2}^{(H)}\lbrack i\rbrack}{d_{2}^{(H)}\lbrack i\rbrack}H_{K_{L},i,2}}} & \cdots & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{2}^{(H)}\lbrack i\rbrack}{d_{2}^{(H)}\lbrack i\rbrack}H_{K_{L},i,K_{L}}}} \\ \vdots & \vdots & ⋰ & \vdots \\ {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{K_{H}}^{(H)}\lbrack i\rbrack}{d_{K_{H}}^{(H)}\lbrack i\rbrack}H_{K_{L},i,1}}} & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{K_{H}}^{(H)}\lbrack i\rbrack}{d_{K_{H}}^{(H)}\lbrack i\rbrack}H_{K_{L},i,2}}} & \cdots & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{K_{H}}^{(H)}\lbrack i\rbrack}{d_{K_{H}}^{(H)}\lbrack i\rbrack}H_{K_{L},i,K_{L}}}} \end{bmatrix}} + Z_{T}}} \\ {= {{RX}_{T} + Z_{T}}} \end{matrix} & {{Eq}.\quad 55} \end{matrix}$

[0155] Now solving directly for the jth low-rate user, can be done as follows. The output for the jth transformed interval is

y _(T) [j]=Rx _(T) [j]+z _(T) [j]  Eq. 56

[0156] As can be seen from Eq. 55, the jth low-rate user is already decoupled in this transformed interval. We can solve for the x_(T)[j] by minimizing the MSE of

E(|x _(T) [j]−L[j]y _(T) [j]| ²)  Eq. 57

[0157] Note that we could get the exact same result for the low-rate users by using d_(j) ^((L)) instead of x_(T)[j] in the cost function above, since x_(T)[j]₁ (first element of x_(T)[j]) depends only on d_(j) ^((L)) and is decoupled from the other users.

[0158] The solution to this is $\begin{matrix} {{{L\lbrack j\rbrack}^{\prime} = {\left( {E\left\lbrack {{y_{T}\lbrack j\rbrack}{y_{T}\lbrack j\rbrack}^{\prime}} \right\rbrack} \right)^{- 1}{E\left( {{y_{T}\lbrack j\rbrack}{x_{T}\lbrack j\rbrack}^{\prime}} \right)}}}{where}} & {{Eq}.\quad 58} \\ {{E\left\lbrack {{y_{T}\lbrack j\rbrack}{y_{T}\lbrack j\rbrack}^{\prime}} \right\rbrack} = {{{R\quad \overset{\_}{{x_{T}\lbrack j\rbrack}{x_{T}^{\prime}\lbrack j\rbrack}}R} + \overset{\_}{{z_{T}\lbrack j\rbrack}{z_{T}^{\prime}\lbrack j\rbrack}}} =}} & {{Eq}.\quad 59} \\ {{2^{m_{L} - m_{H}}{{RP}_{T}\lbrack j\rbrack}R} + {2^{m_{L} - m_{H}}\sigma^{2}R}} & \quad \\ {{E\left\lbrack {{y_{T}\lbrack j\rbrack}{x_{T}\lbrack j\rbrack}^{\prime}} \right\rbrack} = {{R\quad \overset{\_}{{x_{T}\lbrack j\rbrack}{x_{T}^{\prime}\lbrack j\rbrack}}} = {2^{m_{L} - m_{H}}{{RP}_{T}\lbrack j\rbrack}}}} & {{Eq}.\quad 60} \end{matrix}$

[0159] and P_(T)[j] can be expressed as: $\begin{matrix} \begin{matrix} {{P_{T}\lbrack j\rbrack} = {{E\left( {{x_{T}\lbrack j\rbrack}{x_{T}\lbrack j\rbrack}^{\prime}} \right)}/2^{m_{L} - m_{H}}}} \\ {= {\frac{1}{2^{m_{L} - m_{H}}}{{diag}\left( {\left( 2^{m_{L} - m_{H}} \right)^{2}{A_{j}^{(L)}}^{2}{\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{1}^{(H)}\lbrack i\rbrack}}^{2}}} \right.}}} \\ \left. {~~~~~~~~~~~~~~~~~~~~~~~~~}{\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{{A_{2}^{(H)}\lbrack i\rbrack}}^{2}\quad \cdots \quad {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{K_{H}}^{(H)}\lbrack i\rbrack}}^{2}}}} \right) \end{matrix} & {{Eq}.\quad 61} \end{matrix}$

[0160] and if the high-rate symbol powers remain constant throughout the low-rate symbol interval, (i.e., A_(k) ^((H))[i]=A_(k) ^((H)), for all i), then we can write $\begin{matrix} \begin{matrix} {{P_{T}\lbrack j\rbrack} = {{E\left( {{x_{T}\lbrack j\rbrack}{x_{T}\lbrack j\rbrack}^{\prime}} \right)}/2^{m_{L} - m_{H}}}} \\ {= {{diag}\left( {2^{m_{L} - m_{H}}{A_{j}^{(L)}}^{2}{A_{1}^{(H)}}^{2}{A_{2}^{(H)}}^{2}\quad \cdots \quad {A_{K_{H}}^{(H)}}^{2}} \right)}} \end{matrix} & {{Eq}.\quad 62} \end{matrix}$

[0161] If a high-rate symbol window greater than one is used, then the solution remains the same, except that P_(T)[j] will no longer be diagonal, similar to the development in the High Rate User Sections for detecting high-rate users. For example, if we consider a 3 symbol window, then:

x _(T) [j]=[x _(T) [j](−1)^(T) x _(T) [j](0)^(T) x _(T) [j](+1)^(T)]^(T)  Eq. 63

y _(T) [j]=[y _(T) [j](−1)^(T) y _(T) [j ](0)^(T) y _(T) [j](+1)^(T)]^(T)  Eq. 64

x _(T)[1](0)₁ =x _(T)[2](−1)₁ ; x _(T)[2](0)₁ =x _(T)[1](+1)₁ =x _(T)[3](−1)₁, etc.  Eq. 65

y _(T)[1](0)₁ =y _(T)[2](−1)₁ ; y _(T)[2](0)₁ =y _(T)[1](+1)₁ =y _(T)[3](−1)₁, etc.  Eq. 66

[0162] and the diagonal elements of P_(T)[j] will be: $\begin{matrix} {{{{Diagonal}{\quad \quad}{Elements}} = \begin{bmatrix} {\left( 2^{m_{L} - m_{H}} \right)^{2}{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {- 1} \right)}}^{2}} \\ {\sum\limits_{i = 1}^{2^{m_{L} - m_{H}}}{{{A_{1}^{(H)}\lbrack i\rbrack}\left( {- 1} \right)}}^{2}} \\ \vdots \\ {\sum\limits_{i = 1}^{2^{m_{L} - m_{H}}}{{{A_{K_{H}}^{(H)}\lbrack i\rbrack}\left( {- 1} \right)}}^{2}} \\ {\left( 2^{m_{L} - m_{H}} \right)^{2}{{A_{i}^{(L)}(0)}}^{2}} \\ {\sum\limits_{i = 1}^{2^{m_{L} - m_{H}}}{{{A_{1}^{(H)}\lbrack i\rbrack}(0)}}^{2}} \\ \vdots \\ {\sum\limits_{i = 1}^{2^{m_{L} - m_{H}}}{{{A_{K_{H}}^{(L)}\lbrack i\rbrack}(0)}}^{2}} \\ {\left( 2^{m_{L} - m_{H}} \right)^{2}{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {+ 1} \right)}}^{2}} \\ {\sum\limits_{i = 1}^{2^{m_{L} - m_{H}}}{{{A_{1}^{(H)}\lbrack i\rbrack}\left( {+ 1} \right)}}^{2}} \\ \vdots \\ {\sum\limits_{i = 1}^{2^{m_{L} - m_{H}}}{{{A_{K_{H}}^{(H)}\lbrack i\rbrack}\left( {+ 1} \right)}}^{2}} \end{bmatrix}}{{{{d_{i}^{(L)}\lbrack j\rbrack}\left( {- 1} \right)} = {d_{i}^{(L)}(0)}},{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {- 1} \right)} = {A_{i}^{(L)}(0)}},{{{for}\quad j} = 2},3,{\ldots \quad 2^{m_{L} - m_{H}}}}{where}{{{{d_{i}^{(L)}\lbrack j\rbrack}\left( {+ 1} \right)} = {d_{i}^{(L)}(0)}},{{{A_{i}^{(L)}\lbrack j\rbrack}\left( {+ 1} \right)} = {A_{i}^{(L)}(0)}},{{{for}\quad j} = 1},2,3,{{\ldots \quad 2^{m_{L} - m_{H}}} - 1}}} & {{Eq}.\quad 67} \end{matrix}$

[0163] where A_(k) ^((H))[i](−1) is the amplitude of the kth user for the ith high-rate interval of the previous low-rate symbol; the off-diagonal elements are all zero except for the following: $\begin{matrix} \begin{matrix} {{{{for}\quad j} = 2},3,\ldots \quad,{2^{m_{L} - m_{H}}\text{:}}} \\ {\overset{\_}{{x_{T}\lbrack j\rbrack}\left( {- 1} \right){x_{T}\lbrack j\rbrack}(0)^{*}} = \overset{\_}{{x_{T}\lbrack j\rbrack}(0){x_{T}\lbrack j\rbrack}\left( {- 1} \right)^{*}}} \\ {= {{diag}\left( {0\quad {\sum\limits_{i}^{K_{L}}{{{A_{1}^{(H)}\lbrack i\rbrack}}^{2}H_{i,j}H_{{i,{j - 1}}\quad}\quad \cdots \quad {\sum\limits_{i}^{K_{L}}{{{A_{K_{H}}^{(H)}\lbrack i\rbrack}}^{2}H_{i,j}H_{i,{j - 1}}}}}}} \right)}} \\ {{{{for}\quad j} = 1},2,3,\ldots \quad,{2^{m_{L} - m_{H}} - {1\text{:}}}} \\ {\overset{\_}{{x_{T}\lbrack j\rbrack}(0){x_{T}\lbrack j\rbrack}\left( {+ 1} \right)^{*}} = \overset{\_}{{x_{T}\lbrack j\rbrack}\left( {+ 1} \right){x_{T}\lbrack j\rbrack}(0)^{*}}} \\ {= {{diag}\left( {0\quad {\sum\limits_{i}^{K_{L}}{{{A_{1}^{(H)}\lbrack i\rbrack}}^{2}H_{i,j}H_{i,{j + 1}}\quad \cdots \quad {\sum\limits_{i}^{K_{L}}{{{A_{K_{H}}^{(H)}\lbrack i\rbrack}}^{2}H_{i,j}H_{i,{j + 1}}}}}}} \right)}} \\ {{{{for}\quad j} = 2},3,\ldots \quad,{2^{m_{L} - m_{H}} - {1\text{:}}}} \\ {\overset{\_}{{x_{T}\lbrack j\rbrack}\left( {- 1} \right){x_{T}\lbrack j\rbrack}\left( {+ 1} \right)^{*}} = \overset{\_}{{x_{T}\lbrack j\rbrack}\left( {+ 1} \right){x_{T}\lbrack j\rbrack}\left( {- 1} \right)^{*}}} \\ {= {{diag}\left( {0\quad {\sum\limits_{i}^{K_{L}}{{{A_{1}^{(H)}\lbrack i\rbrack}}^{2}H_{i,{j - 1}}H_{i,{j + 1}}\quad \cdots \quad {\underset{i}{\overset{K_{L}}{\quad\sum}}{{{A_{K_{H}}^{(H)}\lbrack i\rbrack}}^{2}H_{i,{j - 1}}H_{i,{j + 1}}}}}}} \right)}} \end{matrix} & {{Eq}.\quad 68} \end{matrix}$

[0164] Note that each group of high-rate intervals making up a specific low-rate interval is transformed separately. Thus, first transform 3 low-rate symbols worth of high-rate outputs are transformed, one low-rate interval at a time, before implementing the high-rate MMSE approach described here to detect a low-rate user.

[0165] Plugging in Eq. 59 and Eq. 60 into Eq. 58, we have the solution

L[j]′=(R+σ ² P _(T) [j] ⁻¹)⁻¹  Eq. 69

[0166] Note that alternative linear transformations are also possible after the initial transformation decouples the low-rate users into separate high-rate intervals. For example, a “decorrelator” approach can be used to decouple the transformed data by forming

R ⁻¹ y _(T) [j]=x _(T) [j]+R ⁻¹ z _(T) [j]  Eq. 70

[0167] An advantage of this approach is that it doesn't depend on the signal-to-noise levels of the users. A disadvantage, however, is that performance will not be as good as the MMSE approach described in this section, since applying the linear transformation R⁻¹ causes degrading noise enhancement to Z_(T).

[0168]FIG. 7 shows a flow chart of the operation of the detector 80. Blocks 90-94 of the operation are similar to the operation of the detector 50 described in blocks 60-64 of FIG. 5. Continuing on to block 96, a decoupling linear transformation is applied to the high rate soft outputs to generate transformed effective high-rate user soft outputs and transformed actual high-rate user soft outputs that remain coupled. Finishing at block 98, an MMSE linear transformation is applied to the transformed outputs to decouple the low-rate users from the actual high rate users.

[0169] Low Rate User Chip Level Processing

[0170] In this section, several methods of recovering the low-rate users are used by applying linear transformations directly to the received signal samples over smaller (“higher-rate”) subintervals. The first two methods are based on the concept that instead of one MMSE processing window over the entire low-rate symbol interval, the MMSE processing can be divided into several separate smaller windows, to obtain an MMSE estimate for the low-rate user for each processing sub-interval, and combine these estimates for the low-rate user in some way. In other words, the 2^(m) ^(_(L)) ^(-m) ^(_(H)) outputs from the high-rate MMSE processing for the low-rate users are combined in some way to get an estimate of the low-rate user. The outputs from the high-rate MMSE processing for the low-rate users follow from the minimization of the cost function

E|d _(i) ^((L)) −v[j]′r[j]| ²

[0171] Thus, dropping the reference to the jth subinterval for convenience, this can be written as: $\begin{matrix} {v = {{E\left\lbrack {rr}^{\prime} \right\rbrack}^{- 1}{E\left\lbrack {rd}_{i}^{{(L)}^{*}} \right\rbrack}}} \\ {= {\left( {{GPG}^{\prime} + {\sigma^{2}I}} \right)^{- 1}{Gp}}} \end{matrix}$ where ${E\left\lbrack {rr}^{\prime} \right\rbrack} = {{{G\quad \overset{\_}{{xx}^{\prime}}G^{\prime}} + \overset{\_}{{nn}^{\prime}}} = {{GPG}^{\prime} + {\sigma^{2}I}}}$ ${E\left\lbrack {rd}_{i}^{{(L)}^{*}} \right\rbrack} = {{G\quad \overset{\_}{{xd}_{i}^{{(L)}^{*}}}} = {Gp}}$

[0172] and where P was defined earlier (High Rate User Symbol Level Processing section) and where p is a vector such that the only non-zero entries in p correspond to the effective high-rate users in x, and the value of these non-zero entries are equal to A_(i) ^((L))H′_(K) _(L) _(i,j), (see the beginning of the Low Rate User Symbol Level Processing).

[0173] Method 1: Low Rate User Chip Level Processing, Decoupling Combining

[0174] In each of the high-rate MMSE outputs (i.e., for each sub-interval) for the low-rate user derived above, part of the low-rate symbol is recovered, i.e., we partly recover an effective high-rate user that represents some combination of the underlying collapsed low-rate users. As described below, these outputs can be combined in some way as to decouple and detect the low-rate users. Using this approach allows us to apply MMSE solutions in smaller subintervals, which reduces complexity, while still recovering the low-rate users.

[0175] We denote the output of the high-rate linear MMSE transformation for the effective high-rate user in the jth high-rate subinterval as:

y _(e) [j]=v _(e) [j]′r[j]  Eq. 71

[0176] We can further define a vector of effective high-rate user symbol outputs for all intervals as:

y _(e) [y _(e)[1] . . . y _(e)[2^(m) ^(_(L)) ^(-m) ^(_(H)) ]]^(T)  Eq. 72

[0177] Assuming that we are taking neighboring symbols into account by using a window of 3 full high-rate symbols for each high-rate interval MMSE solution. This choice of processing window is not meant to limit the development in this section at all, and it can be easily and directly extended to any window size, including windows that only take into account less than one full neighbor symbol on each side. Accordingly, defining r as the vector of received samples over the low-rate symbol interval, (2^(m) ^(_(L)) chips), and extending this on either side of the low-rate interval to accommodate multipath delay spread and the modeling of edge effects. Thus, if a window of 3-high rate symbols is used in the high-rate MMSE detection, we would need an extra high-rate interval of received samples on either side, plus some extra samples to accommodate delay spread. Based on this, we can express

Y_(e)=V_(e)′r  Eq. 73

[0178] where r extends over 2^(m) ^(_(L)) +2(2^(m) ^(_(H)) +ds) chips, where ds is the number of extra chips needed for the delay spread on each side, and where $\begin{matrix} {V_{e}^{\prime} = \begin{bmatrix} \left\lbrack {v_{e}\lbrack 1\rbrack}^{T} \right\rbrack & \quad & \quad & \quad & \quad \\ \quad & \left\lbrack {v_{e}\lbrack 2\rbrack}^{T} \right\rbrack & \quad & 0 & \quad \\ \quad & \quad & ⋰ & \quad & \quad \\ \quad & 0 & \quad & \left\lbrack {v_{e}\left\lbrack {2^{m_{L} - m_{H}} - 1} \right\rbrack}^{T} \right\rbrack & \quad \\ \quad & \quad & \quad & \quad & \left\lbrack {v_{e}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}^{T} \right\rbrack \end{bmatrix}} & {{Eq}.\quad 74} \end{matrix}$

[0179] where each vector v_(e)[j]^(T) is of length 3*2^(m) ^(_(H)) +2ds. The vectors v_(e)[j]^(T) are shifted to the left by 2^(m) ^(_(H)) in each successive row; thus, the matrix V_(e)′ has dimensions 2^(m) ^(_(L)) ^(-m) ^(_(H)) ×(2^(m) ^(_(L)) +2(2^(m) ^(_(H)) +ds)).

[0180] Note that if this does not consider edge effects, and instead uses a single high-rate symbol window for each high-rate interval MMSE detection, then r would extend over 2^(m) ^(_(L)) +2ds, v_(e)[j]^(T)would be of length 2^(m) ^(_(H)) +2ds, and V_(e)′ would have dimension 2^(m) ^(_(L)) ^(-m) ^(_(H)) ×2^(m) ^(_(L)) +2ds Now the effective high-rate symbol soft MMSE outputs can be expressed as follows: $\begin{matrix} \begin{matrix} {y_{e} = {V_{e}^{\prime}r}} \\ {= {{V_{e}^{\prime}{Gx}} + {V_{e}^{\prime}n}}} \\ {= {{V_{e}^{\prime}\left( {{G_{e}x_{e}} + {G_{\sim e}x_{\sim e}}} \right)} + z_{e}}} \\ {= {{V_{e}^{\prime}G_{e}x_{e}} + {V_{e}^{\prime}G_{\sim e}x_{\sim e}} + z_{e}}} \\ {= {{Q_{e}x_{e}} + {V_{e}^{\prime}G_{\sim e}x_{\sim e}} + z_{e}}} \end{matrix} & {{Eq}.\quad 75} \end{matrix}$

[0181] where x is defined as in Eq. 37; x_(e) is a vector (length 2^(m) ^(_(L)) ^(-m) ^(_(H)) ) which contains the data of the effective high-rate users only (for all 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate intervals within the low-rate interval being processed); x_(˜e) contains the data of the remaining users; G_(e) is the code matrix, (with dimensions (2^(m) ^(_(L)) +2(2^(m) ^(_(H)) +ds))×1^(m) ^(_(L)) ^(-m) ^(_(H)) ), with each column containing the effective high-rate user code for a different high-rate interval, (shifted horizontally to represent the relative timing of the interval); G_(˜e) is the code matrix for the remaining users; the middle term, V_(e)′G_(˜e)x_(˜e), represents the residual interference after the MMSE linear transformation is applied; z_(e) is the post-MMSE processed thermal noise; Q_(e) is implicitly defined in the above equation as

Q_(e)=V_(e)′G_(e)  Eq. 76

[0182] and is a square matrix of order 2^(m) ^(_(L)) ^(-m) ^(_(H)) . Note that Q_(e) will be diagonal in the case when only a single high-rate symbol interval is considered for the high-rate MMSE detection, (and where there is no multipath delay spread, i.e., ds=0). As we saw in Eq. 48, we can express the effective high-rate user outputs as:

x _(e) =H _(K) _(L) A ^((L)) d ^((L))  Eq. 77

[0183] Therefore, in order to decouple and recover the low-rate users, form $\begin{matrix} \begin{matrix} {y_{L} = {H_{K_{L}}^{\prime}Q_{e}^{- 1}V_{e}^{\prime}r}} \\ {= {H_{K_{L}}^{\prime}Q_{e}^{- 1}y_{e}}} \end{matrix} & {{Eq}.\quad 78} \end{matrix}$

[0184] Low Rate User Chip Level Processing, General Decoupling Combining

[0185] Based on the above discussion, a general form of decoupling combining (to recover the low-rate user symbol from the effective high-rate user symbol estimates) can be defined where the initial high-rate processing is done by some general linear transformation, namely: $\begin{matrix} \begin{matrix} {y_{L} = {{H_{K_{L}}^{\prime}\left( {LG}_{e} \right)}^{- 1}{Lr}}} \\ {= {{H_{K_{L}}^{\prime}\left( {LG}_{e} \right)}^{- 1}y_{e}}} \end{matrix} & {{{Eq}.\quad 78}a} \end{matrix}$

[0186] where L is some linear transform of dimensions 2^(m) ^(_(L)) ^(-m) ^(_(H)) ×(2^(m) ^(_(L)) +2(2^(m) ^(_(H)) +ds)), (for the 3-symbol window case), y_(e)=Lr provides estimates of the effective high-rate user symbols, and G_(e) (dimensions (2^(m) ^(_(L)) +2(2^(m) ^(_(H)) +ds))×2^(m) ^(_(L)) ^(-m) ^(_(H)) ) was defined implicitly in Eq. 75: $\begin{matrix} \begin{matrix} {r = {{Gx} + n}} \\ {= {{G_{e}x_{e}} + {G_{\sim e}x_{\sim e}} + n}} \end{matrix} & {{{Eq}.\quad 78}b} \end{matrix}$

[0187] The application of (LG_(e))⁻¹L to r is decouples the effective high-rate symbols, x_(e), and the subsequent application of H′_(K) _(L) will combine the effective high-rate data values in such a way as to recover the low-rate data. Considering several special cases:

[0188] 1. $\underset{\_}{L = G_{e}^{\prime}}.$

[0189] This is equivalent to applying the generalized inverse of G_(e) to r to decouple the effective high-rate symbols x_(e).

[0190] 2. L=V_(e)′, as discussed above (e.g., Eq. 78), where the rows of V_(e)′ contain the high-rate MMSE solutions for the effective high-rate user outputs, (Eq. 75).

[0191] 3. L can be chosen to minimize Ex_(e) − (LG_(e))⁻¹Lr²

[0192] Method 2: Low Rate User Chip Level Processing, MMSE Combining

[0193] The method described in the previous section applied a weight vector to y_(e), (containing outputs for the effective high-rate user for each interval, see Eq. 78), to decouple or “decorrelate” the low rate users. In this section, the techniques attempt to derive a weight vector that when applied to y_(e) would minimize the following MSE: $\begin{matrix} {E\left( {{d_{k}^{(L)} - {w^{\prime}y_{e}}}}^{2} \right)} & {{Eq}.\quad 79} \end{matrix}$

[0194] to solve for the kth low-rate user's symbol. The solution to this is $\begin{matrix} {w = {\left( \overset{\_}{y_{e}y_{e}^{\prime}} \right)^{- 1}\left( \overset{\_}{y_{e}d_{k}^{{(L)}^{*}}} \right)}} & {{Eq}.\quad 80} \end{matrix}$

[0195] where, based on Eq. 75, $\begin{matrix} \begin{matrix} {\overset{\_}{y_{e}y_{e}^{\prime}} = {{V^{\prime}\overset{\_}{{rr}^{\prime}}V_{e}} = {{V_{e}^{\prime}\left( {{G\overset{\_}{\quad {xx}^{\prime}}G^{\prime}} + {\sigma^{2}I}} \right)}V_{e}}}} \\ {= {{V_{e}^{\prime}\left( {{{GP}_{xx}G^{\prime}} + {\sigma^{2}I}} \right)}V_{e}}} \end{matrix} & {{Eq}.\quad 81} \\ \begin{matrix} {\overset{\_}{y_{e}d_{k}^{{(L)}^{*}}} = {{V_{e}^{\prime}\overset{\_}{r\quad d_{k}^{{(L)}^{*}}}} = {V_{e}^{\prime}G\quad \overset{\_}{{xd}_{k}^{{(L)}^{*}}}}}} \\ {= {V_{e}^{\prime}{GP}_{xd}}} \end{matrix} & {{Eq}.\quad 82} \end{matrix}$

[0196] where {overscore (rr′)} is expressed similarly to what was done in Eq. 24; The matrices P_(xx) and P_(xd) have already been defined in the section on Low-Rate User Symbol-level Processing with MMSE Combining. Plugging in Eq. 81 and Eq. 82 into Eq. 81, yields

w=[V _(e)′(GP _(xx) G′+σ ² I)V _(e) ] ⁻¹ V _(e) ′GP _(xd)  Eq. 83

[0197] Method 3: Preprocessing Over the Low-Rate Interval

[0198] The approach described here is very similar to the symbol-level preprocessing approach previously described, except that here we operate directly on the received signal, (i.e., there would be no front-end high-rate detector 82 in FIG. 6B). Here we transform the received signal vectors for the 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate intervals to a new set of received signal vectors for K_(L) transformed intervals. The transformation serves to decouple the low-rate users into K_(L) separate distinct pseudo-high-rate intervals, (FIG. 6A). This initial transformation enables applying a single high-rate linear transform over a single high-rate interval, thus, significantly reducing complexity. Recall that Method 1 and Method 2 of the previous 2 sub-sections, entailed computing an MMSE solution for each high-rate interval, with post-processing combining of these multiple MMSE high-rate outputs to get an estimate for a low-rate symbol. Here, the preprocessing enables the detection to consist of a single high-rate MMSE transform, with no post-processing combining necessary.

[0199] The approach described here requires that the code words for each user repeat (to within a sign change) every high-rate interval, a property that is satisfied by the spreading codes introduced earlier. This will generally not be the case in commercial systems for the other-cell users since the transmissions from different cells are mixed with unique very long codes spanning many symbols. (One cell can be processed by first stripping off the long code.) As such, we will not include the other-cell user in this section. For systems where the other-cell users' code-words did repeat every high-rate interval (to within a sign change), then they could easily be included in the processing. Note that even if only intra-cell signals are processed, this low complexity method will provide better performance than a standard MMSE chip equalizer.

[0200] The received signal samples for the 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate intervals can be rearranged as follows, (assuming a single symbol window, i.e., no edge effects): $\begin{matrix} \begin{matrix} {\Re = \left\lfloor {{r\lbrack 1\rbrack}\quad {r\lbrack 2\rbrack}\quad \cdots \quad {r\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \right\rfloor} \\ {= {G\left\lbrack {{{x\lbrack 1\rbrack}\quad {x\lbrack 2\rbrack}\quad \cdots \quad {x\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} + {{n\lbrack 1\rbrack}\quad {n\lbrack 2\rbrack}\quad \cdots \quad {n\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}}} \right\rbrack}} \\ {= {{G\begin{bmatrix} {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,1}^{\prime}}} & {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,2}^{\prime}}} & \cdots & {\sum\limits_{i}^{K_{L}}{A_{i}^{(L)}d_{i}^{(L)}H_{K_{L},i,2^{m_{L} - m_{H}}}^{\prime}}} \\ {{A_{1}^{(H)}\lbrack 1\rbrack}{d_{1}^{(H)}\lbrack 1\rbrack}} & {{A_{1}^{(H)}\lbrack 2\rbrack}{d_{1}^{(H)}\lbrack 2\rbrack}} & \cdots & {{A_{1}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}{d_{1}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \\ {{A_{2}^{(H)}\lbrack 1\rbrack}{d_{2}^{(H)}\lbrack 1\rbrack}} & {{A_{2}^{(H)}\lbrack 2\rbrack}{d_{2}^{(H)}\lbrack 2\rbrack}} & \cdots & {{A_{2}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}{d_{2}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \\ \vdots & \vdots & ⋰ & \vdots \\ {{A_{K_{H}}^{(H)}\lbrack 1\rbrack}{d_{K_{H}}^{(H)}\lbrack 1\rbrack}} & {{A_{K_{H}}^{(H)}\lbrack 2\rbrack}{d_{K_{H}}^{(H)}\lbrack 2\rbrack}} & \cdots & {{A_{K_{H}}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}{d_{K_{H}}^{(H)}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}} \end{bmatrix}} + N}} \\ {= {{GX} + N}} \end{matrix} & {{Eq}.\quad 84} \end{matrix}$

[0201] where

is of dimensions (2^(m) ^(_(H)) +2ds)×2^(m) ^(_(L)) ^(-m) ^(_(H)) and the code matrix G is of dimensions (2^(m) ^(_(H)) +22ds)×K, (with K=K_(H)+1). Note that G does not depend on the interval number, j, because of the assumption, (stated above), that all the code words repeat (to within a sign change) every high-rate interval. Note also that the vectors r[j] and r[j±1] will overlap if there is some delay spread, (or if we are using a processing window of greater than 1 symbol, as indicated later in this section). The first row of the matrix X can be expressed as follows:

[A ₁ ^((L)) d ₁ ^((L)) A ₂ ^((L)) d ₂ ^((L)) . . . A_(K) _(L) ^((L)) d _(K) _(L) ^((L)) ]H′ _(K) _(L)   Eq. 85

[0202] where H_(K) _(L) , (defined earlier), is a 2^(m) ^(_(L)) ^(-m) ^(_(H)) ×K_(L) matrix with K_(L) columns of the Walsh-Hadamard matrix of order 2^(m) ^(_(L)) ^(-m) ^(_(H)) . We can transform these 2^(m) ^(_(L)) ^(-m) ^(_(H)) high-rate interval received signal vectors into K_(L) transformed received signal vectors as follows: $\begin{matrix} \begin{matrix} {\Re_{T} = {\Re \quad H_{K_{L}}\quad {{Eq}.\quad 86}}} \\ {{= \left\lbrack {{r_{T}\lbrack 1\rbrack}\quad {r_{T}\lbrack 2\rbrack}\quad \cdots \quad {r_{T}\left\lbrack K_{L} \right\rbrack}} \right\rbrack}\quad} \\ {= {{G\left\lbrack {{x_{T}\lbrack 1\rbrack}\quad {x_{T}\lbrack 2\rbrack}\quad \cdots \quad {x_{T}\left\lbrack K_{L} \right\rbrack}} \right\rbrack} + \left\lbrack {{n_{T}\lbrack 1\rbrack}\quad {n_{T}\lbrack 2\rbrack}\quad \cdots \quad {n_{T}\left\lbrack K_{L} \right\rbrack}} \right\rbrack}} \\ {= {{G\begin{bmatrix} {2^{m_{L} - m_{H}}A_{1}^{(L)}d_{1}^{(L)}} & {2^{m_{L} - m_{H}}A_{2}^{(L)}d_{2}^{(L)}} & \cdots & {2^{m_{L} - m_{H}}A_{K_{L}}^{(L)}d_{K_{L}}^{(L)}} \\ {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{1}^{(H)}\lbrack i\rbrack}{d_{1}^{(H)}\lbrack i\rbrack}H_{K_{L},i,1}}} & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{1}^{(H)}\lbrack i\rbrack}{d_{1}^{(H)}\lbrack i\rbrack}H_{K_{L},i,2}}} & \cdots & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{1}^{(H)}\lbrack i\rbrack}{d_{1}^{(H)}\lbrack i\rbrack}H_{K_{L},i,K_{L}}}} \\ {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{2}^{(H)}\lbrack i\rbrack}{d_{2}^{(H)}\lbrack i\rbrack}H_{K_{L},i,1}}} & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{2}^{(H)}\lbrack i\rbrack}{d_{2}^{(H)}\lbrack i\rbrack}H_{K_{L},i,2}}} & \cdots & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{2}^{(H)}\lbrack i\rbrack}{d_{2}^{(H)}\lbrack i\rbrack}H_{K_{L},i,K_{L}}}} \\ \vdots & \vdots & ⋰ & \vdots \\ {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{K_{H}}^{(H)}\lbrack i\rbrack}{d_{K_{H}}^{(H)}\lbrack i\rbrack}H_{K_{L},i,1}}} & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{K_{H}}^{(H)}\lbrack i\rbrack}{d_{K_{H}}^{(h)}\lbrack i\rbrack}H_{K_{L},i,2}}} & \cdots & {\sum\limits_{i}^{2^{m_{L} - m_{H}}}{{A_{K_{H}}^{(H)}\lbrack i\rbrack}{d_{K_{H}}^{(H)}\lbrack i\rbrack}H_{K_{L},i,K_{L}}}} \end{bmatrix}} + N_{T}}} \\ {= {{GX}_{T} + N_{T}}} \end{matrix} & \quad \end{matrix}$

[0203] where the matrix of transformed received chips,

_(T), is of dimensions (2^(m) ^(_(H)) +2ds)×K_(L).

[0204] As previously mentioned, (when this technique was discussed for symbol-level processing), alternative linear transformations are also possible after the initial transformation decouples the low-rate users into separate high-rate intervals. An MMSE approach is described below.

[0205] Solve directly for the jth low-rate user as follows. The received signal for the jth transformed interval is

r _(T) [j]=Gx _(T) [j]+n _(T) [j]  Eq. 87

[0206] As can be seen from Eq. 86, the jth low-rate is already decoupled in this transformed interval. We can solve for the low rate user symbol d_(j) ^((L)) by minimizing the MSE of $\begin{matrix} {E\left( {{d_{j}^{(L)} - {{v\lbrack j\rbrack}^{\prime \quad}{r_{T}\lbrack j\rbrack}}}}^{2} \right)} & {{Eq}.\quad 88} \end{matrix}$

$\begin{matrix} {{{v\lbrack j\rbrack} = {\left( {E\left\lbrack {{r_{T}\lbrack j\rbrack}{r_{T}\lbrack j\rbrack}^{\prime}} \right\rbrack} \right)^{- 1}{E\left\lbrack {{r_{T}\lbrack j\rbrack}d_{j}^{{(L)}^{*}}} \right\rbrack}}}{where}} & {{Eq}.\quad 89} \\ {{E\left\lbrack {{r_{T}\lbrack j\rbrack}{r_{T}\lbrack j\rbrack}^{\prime}} \right\rbrack} = {{{G\quad \overset{\_}{{x_{T}\lbrack j\rbrack}{x_{T}^{\prime}\lbrack j\rbrack}}\quad G^{\prime}} + \overset{\_}{{n_{T}\lbrack j\rbrack}{n_{T}^{\prime}\lbrack j\rbrack}}} =}} & {{Eq}.\quad 90} \\ {\quad {{2^{m_{L} - m_{H}}{{GP}_{{xx},T}\lbrack j\rbrack}G^{\prime}} + {2^{m_{L} - m_{H}}\sigma^{2}I}}} & \quad \\ {{E\left\lbrack {{r_{T}\lbrack j\rbrack}d_{j}^{{(L)}^{*}}} \right\rbrack} = {{G\overset{\_}{\quad {{x\lbrack j\rbrack}d_{j}^{{(L)}^{*}}}}} = {2^{m_{L} - m_{H}}{{GP}_{{xd},T}\lbrack j\rbrack}}}} & {{Eq}.\quad 91} \end{matrix}$

[0207] where P_(xx,T)[j] is defined as P_(T)[j] earlier; P_(xd,T) is a vector of all zeros except for the nonzero entry corresponding to ${\overset{\_}{{x\lbrack j\rbrack}_{1}d_{j}^{{(L)}^{*}}} = A_{j}^{(L)}},$

[0208] (here, the first entry in P_(xd,T))

[0209] If we utilize a high-rate symbol window greater than one is used, then the solution is similar. For example, using a 3 symbol window for processing, then

x _(T) [j]=[x _(T) [j](−1)^(T) x _(T) [j](0)^(T) x _(T) [j](+1)^(T)]^(T)  Eq. 92

r _(T) [j]=[r _(T) [j](−1)^(T) r _(T) [j](0)^(T) r _(T) [j](+1)^(T)]^(T)  Eq. 93

[0210] where as before, [j](+1) and [j](−1) refer to the interval succeeding and the interval preceding the jth interval, respectively; thus:

x _(T)[1](0)₁ =x _(T)[2](−1)₁ ; x _(T)[2](0)₁ =x _(T)[1](+1)₁ =x _(T)[3](−1)₁, etc.  Eq. 94

r _(T)[1](0)₁ =r _(T)[2](−1)₁ ; r _(T)[2](0)₁ =r _(T)[1](+1)₁ =r _(T)[3](−1)₁,etc.  Eq. 95

[0211] For this case, the matrix P_(xx,T)[j] is defined earlier. In addition, the vector P_(xd,T) is a vector of all zeros except for three non-zero entries corresponding to $\begin{matrix} {\overset{\_}{{x\lbrack j\rbrack}_{1}(0)d_{j}^{{(L)}^{*}}} = {\overset{\_}{{x_{T}\lbrack j\rbrack}_{1}\left( {\pm 1} \right)d_{j}^{{(L)}^{*}}} = A_{j}^{(L)}}} & {{Eq}.\quad 96} \end{matrix}$

[0212] except at the edges where $\begin{matrix} {\overset{\_}{{x_{T}\lbrack 1\rbrack}_{1}\left( {- 1} \right)d_{j}^{{(L)}^{*}}} = {\overset{\_}{{x_{T}\left\lbrack 2^{m_{L} - m_{H}} \right\rbrack}_{1}\left( {+ 1} \right)d_{j}^{{(L)}^{*}}} = {{vector}\quad {of}\quad {all}\quad {zeros}}}} & {{Eq}.\quad 97} \end{matrix}$

[0213] Note that the received signal chips are transformed one low-rate interval separately at a time. Thus, when using a processing window larger than one symbol (i.e., for taking edge effects into account), one needs to first transform 3 low-rate symbols worth of received samples, (transformed one low-rate interval at a time), before implementing the high-rate MMSE approach described here to detect a low-rate user. In other words, in order to obtain r_(T)[1](−1)^(T) and r_(T)[2^(m) ^(_(L)) ^(-m) ^(_(H)) ](+1)^(T), one needs to first transform the entire previous and successive low-rate intervals, respectively.

[0214] Plugging in Eq. 90 and Eq. 91 into Eq. 89, gives the solution

v[j]=(GP _(xx,Y) [j]G′+σ ² I)⁻¹ GP _(xd,T) [j]  Eq. 98

[0215] Generalized Preprocessing Over the Low-Rate Interval

[0216] The previous sub-section, we considered a specific type of preprocessing which decouples the low-rate users into separate high-rate intervals. However, this may not be the optimal preprocessing transformation. In particular, it does not take other-cell users into account at all. Therefore, below we formulate a more general approach to utilizing the concept of preprocessing that could also take other-cell users into account. Assume that instead of a Walsh-Hadamard transform, the preprocessing for user j involves some arbitrary column vector h, i.e.,

r _(T)

[j]=

h _(j)  Eq. 99

[0217] Grouping the received signal in 9 and performing this transformation essentially converts the number of samples to be processed from 2^(m) ^(_(L)) +2ds to 2^(m) ^(_(H)) +2ds, (i.e., a many-to-one transformation). The processing of this reduced sample space is suboptimal compared to the larger sample space. Nevertheless, we can attempt to optimize the processing given that the maximum number of samples to process is set to some reduced level, (e.g., because of complexity considerations). The general approach to accomplish this can be described as follows:

[0218] 1. Arrange the received signal samples in columns of length equal to the maximum number of samples you wish to process in one shot.

[0219] 2. Initialize preprocessing transformation h_(j) (e.g., to Walsh Hadamard transform column vector corresponding to the desired low-rate user—user j—as in the previous section).

[0220] 3. Transform the received signal matrix of Step 1 by post-multiplying by the vector h_(j), thus, reducing the sample space. This transformation is meant to decouple in some way low-rate user j from the other low-rate users in the reduced sample space.

[0221] 4. Compute the MMSE mapping, given h_(j). This will yield an MMSE solution which is a function of h_(j), i.e., $\begin{matrix} \left. {\min \quad {E\left( {{d_{j}^{(L)} - {{v\lbrack j\rbrack}^{\prime}\Re \quad h_{j}}}}^{2} \right)}}\Rightarrow{{v\lbrack j\rbrack}_{MMSE}\left( h_{j} \right)} \right. & {{Eq}.\quad 100} \end{matrix}$

[0222] 5. Take the derivative of the MMSE solution with respect to h_(j) in order to find the optimum h_(j) preprocessing transformation vector.

[0223] An alternative to computing the derivative in Step 5 is to utilize numerical optimization techniques to iterate to the optimal h_(j) solution. Therefore, Step 5 would now read:

[0224] 5. Compute an improved value for h_(j), (e.g., adaptively)

[0225] 6. Go to Step 3

[0226] A similar generalized preprocessing approach can be applied to the symbol level processing of the Preprocessing Over the Low-Rate Interval section.

[0227] The approach described here can be generalized further by (1) applying some arbitrary preprocessing to the received signal samples that reduces the sample space (i.e., without any specific restrictions on how to perform the preprocessing), (2) computing the MMSE solution as a function of this preprocessing transformation, and (3) finding the optimal preprocessing transformation (directly/analytically or numerically/adaptively/iteratively).

[0228]FIG. 8 shows a wireless device 100 for communicating information. The wireless device 100 may include a transceiver 102 coupled to an antenna 103 to communicate information with other wireless devices. A baseband device 106 may implement call processing, system control, and the man-machine interface. The baseband device 106 may include a multi-user multi-rate detector 104 to detect a conditioned input signal generated by the transceiver 102. The multi-user multi-rate detector 104 operates in accordance with one or more aspects of the detector described in this specification. The baseband device 106 may also include an audio codec to interface to one or more input/output (I/O) devices 106 such as keyboards, speakers, and microphones.

[0229] A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims. 

What is claimed is:
 1. A system, comprising: a high-rate linear Minimum Mean Square Error (MMSE) detector having a detection window, and producing outputs every high-rate detection interval, to generate at least one actual high-rate output based upon decoding an input signal that includes actual high-rate users and low-rate users, the at least one actual high-rate output corresponding to one of the actual high-rate users, the high-rate users having a higher user rate than the low-rate users.
 2. The system of claim 1 wherein the input signal includes interfering higher-rate users having a symbol period shorter than high-rate detection intervals of the high-rate linear MMSE detector.
 3. The system of claim 1 wherein the input signal is selected from a group consisting of a sampled signal and at least one output of a front-end high-rate detector applied to the sampled signal.
 4. The system of claim 1 wherein a length of the detection window is not a function of a length of the high-rate detection interval.
 5. The system of claim 1 wherein the detection window is greater than the high-rate detection interval and is a sliding window such that successive detection windows overlap, each detection of the successive detection windows producing a high-rate output for at least one symbol of the one of the actual high-rate users.
 6. The system of claim 1 further comprising a space-time adaptive processor to generate the input signal from multi-antenna signal streams.
 7. The system of claim 1 further including a cancellation module to apply interference cancellation processing to the input signal before the high-rate linear MMSE detector.
 8. The system of claim 1 wherein the at least one actual high-rate output includes recovered symbols used to estimate and cancel interference.
 9. The system of claim 1 wherein the at least one actual high-rate output further comprises recovered symbols that include forward error correction encoded symbols; and further comprising a decoder to recover information bits associated with the forward error correction encoded symbols.
 10. The system of claim 1 wherein the high-rate linear MMSE detector is based on modeling the low-rate users as effective high-rate users, the modeling based on a tree-structure property of spreading codes associated with the low-rate users.
 11. The system of claim 10 wherein the input signal includes interfering higher-rate users having a symbol period shorter than the high-rate detection intervals of the high-rate linear MMSE detector.
 12. The system of claim 10 wherein the input signal is selected from a group consisting of a sampled signal and at least one output of a front-end high-rate detector applied to the sampled signal.
 13. The system of claim 10 wherein a length of the detection window is independent of a length of the high-rate detection interval.
 14. The system of claim 10 wherein the detection window is greater than the high-rate detection interval and is sliding such that successive detection windows overlap, each detection of the successive detection windows producing a high-rate output for at least one symbol of the one of the actual high-rate users.
 15. The system of claim 10 further comprising a space-time adaptive processor to generate the input signal from multi-antenna signal streams.
 16. The system of claim 10 further including a cancellation module to apply interference cancellation processing to the input signal before the high-rate linear MMSE detector.
 17. The system of claim 10 wherein the actual high-rate outputs are used to estimate and cancel interference in the input signal.
 18. The system of claim 10 wherein at least one of the actual high-rate outputs further comprise recovered symbols that include forward error correction encoded symbols; and further comprising a decoder to recover information bits associated with the forward error correction encoded symbols.
 19. A system, comprising: a general linear transformation detector having a detection window, and producing outputs at every high-rate detection interval, to generate high-rate outputs based upon decoding an input signal that includes low-rate users, within each high-rate interval at least one of the high-rate outputs corresponding to one of the low-rate users; a second stage including a combining technique to combine successive high-rate outputs of the stage corresponding to one of the low-rate users over a low-rate symbol period to generate a low-rate output corresponding to one of the low-rate users.
 20. The system of claim 19 wherein the general linear transformation detector is a high-rate linear Minimum Mean Square Error (MMSE) detector.
 21. The system of claim 20 wherein the second stage combining technique is selected from a group consisting of Decoupling Combining, General Decoupling Combining, and MMSE Combining.
 22. The system of claim 19 wherein the second stage combining technique is General Decoupling Combining.
 23. The system of claim 20 wherein the input signal includes interfering higher-rate users having a symbol period shorter than the high-rate detection intervals of the high-rate linear MMSE detector.
 24. The system of claim 20 wherein the input signal is selected from a group consisting of a sampled signal and at least one output of a front-end high-rate detector applied to the sampled signal.
 25. The system of claim 20 wherein a length of the detection window is not a function of a length of the high-rate detection interval.
 26. The system of claim 20 wherein the detection window is greater than the high-rate detection interval and is sliding such that successive detection windows overlap, each detection of the successive detection windows producing a high-rate output.
 27. The system of claim 20 further comprising a space-time adaptive processor to generate the input signal based upon multi-antenna signal streams.
 28. The system of claim 20 further including a cancellation module to apply interference cancellation processing to the input signal before the high-rate linear MMSE detector.
 29. The system of claim 20 wherein the low-rate output includes recovered symbols used to estimate and cancel interference.
 30. The system of claim 20 wherein the low-rate output further comprises recovered symbols that include forward error correction encoded symbols; and further comprising a decoder to recover information bits associated with the forward error correction encoded symbols.
 31. The system of claim 20 wherein the high-rate linear MMSE detector is based on modeling the low-rate users as effective high-rate users, the modeling based on a tree-structure property of spreading codes associated with the low-rate users; the high-rate MMSE linear detector to generate effective high-rate outputs corresponding to the effective high-rate users; and the second stage to combine successive effective high-rate outputs of the high-rate MMSE linear detector for an effective high-rate user over a low-rate symbol period to generate the low-rate output corresponding to the one of the low-rate users.
 32. The system of claim 31 wherein the second stage employs a combining technique selected from a group consisting of Decoupling Combining and MMSE Combining.
 33. The system of claim 19 wherein the general linear transformation detector is based on modeling the low-rate users as effective high-rate users, the modeling based on a tree-structure property of spreading codes associated with the low-rate users; the general linear transformation detector to generate effective high-rate outputs corresponding to the effective high-rate users; the second stage to combine successive effective high-rate outputs of the general linear transformation detector for the an effective high-rate user over a low-rate symbol period to generate the low-rate output corresponding to the one of the low-rate users; and the second stage combining technique based on General Combining Decoupling.
 34. The system of claim 31 wherein the input signal includes interfering higher-rate users having a symbol period shorter than the high-rate detection intervals of the high-rate linear MMSE detector.
 35. The system of claim 31 wherein the input signal is selected from a group consisting of a sampled signal and at least one output of a front-end high-rate detector applied to the sampled signal.
 36. The system of claim 31 wherein a length of the detection window is not a function of a length of the high-rate detection interval.
 37. The system of claim 31 wherein the detection window is greater than the high-rate detection interval and is sliding such that successive detection windows overlap, each detection of the successive detection windows producing a high-rate output.
 38. The system of claim 31 further comprising a space-time adaptive processor to generate the input signal from multi-antenna signal streams.
 39. The system of claim 31 further including a cancellation module to apply interference cancellation processing to the input signal before the high-rate linear MMSE detector.
 40. The system of claim 31 wherein the low-rate output is used to estimate and cancel interference.
 41. The system of claim 31 wherein the low-rate output further comprises recovered symbols that include forward error correction encoded symbols; and further comprising a decoder to recover information bits associated with the forward error correction encoded symbols.
 42. A system comprising a first stage to transform a set of inputs over a low-rate interval and to generate sets of transformed inputs corresponding to predetermined high-rate intervals within a detection window, the set of inputs having embedded information corresponding to low-rate users, the low-rate users modeled as an effective high-rate user based on a tree-structure property of spreading codes associated with the low-rate users, spreading codes of interfering users and the effective high-rate user being cyclic and repeating to within a sign change at each high-rate interval; within the set of transformed inputs corresponding to a predetermined high-rate interval, one of the low-rate users is decoupled from others of the low-rate users that comprise the effective high-rate user; and a second stage to apply a general linear detector to the transformed set of inputs over the predetermined high-rate intervals within the detection window, to generate an estimate of one of the low-rate users.
 43. The system of claim 42 wherein the general linear detector is a Minimum Mean Square Error (MMSE) linear detector.
 44. The system of claim 43 wherein the set of inputs includes interfering higher-rate users having a symbol period shorter than the high-rate interval.
 45. The system of claim 43 wherein the set of inputs is selected from the group consisting of a sampled signal, and at least one output of a front-end high-rate detector applied to the sampled signal.
 46. The system of claim 43 wherein a length of the detection window is independent of a length of the high-rate interval.
 47. The system of claim 43 wherein the detection window is greater than the high-rate interval.
 48. The system of claim 43 further comprising a space-time adaptive processor to generate the set of inputs from multi-antenna signal streams.
 49. The system of claim 43 further including a cancellation module to apply interference cancellation processing to the set of inputs.
 50. The system of claim 43 wherein at least one output of the second stage is used to estimate and cancel interference.
 51. The system of claim 43 wherein the estimate of one of the low-rate users includes forward error correction encoded symbols to be processed by a decoder to recover information bits.
 52. The system of claim 43 wherein a sampled receive signal includes the set of inputs modulated by a long spreading sequence that does not satisfy the tree-structured property, the set of inputs being generated by stripping off the long spreading sequence.
 53. The system of claim 42 wherein the first stage further comprises post-multiplying a matrix containing the set of inputs by a column of a Walsh Hadamard Transform matrix.
 54. A method comprising: receiving an input signal including at least one actual high rate user and a plurality of low rate users, the actual high rate user having a higher user rate than the low rate users; applying a high rate Minimum Mean Square Error (MMSE) transformation to the input signal over a high rate detection interval; and based on the MMSE transformation, generating at least one detector output corresponding to the at least one actual high rate user and the plurality of low rate users.
 55. The method of claim 54 wherein the at least one detector output is an actual high rate output corresponding to the at least one actual high rate user.
 56. The method of claim 54 further comprising generating at least one effective high-rate output corresponding to a group of the low-rate users.
 57. The method of claim 54 wherein the at least one detector output is a low-rate output corresponding to a one of the plurality of low-rate users.
 58. The method of claim 57 further comprising generating at least one effective high-rate output corresponding to a group of the low-rate users.
 59. The method of claim 57 further comprising combining successive high-rate outputs over a low-rate symbol period to generate the low rate output corresponding to the one of the plurality of low-rate users.
 60. The method of claim 59 wherein combining includes a transformation selected from a group consisting of decoupling combining and MMSE combining.
 61. The method of claim 54 further comprising selecting a detection window of the high rate MMSE transformation such that the detection window is not a function of the high rate detection interval.
 62. The method of claim 61 further comprising selecting the detection window to be greater than the high rate detection interval and sliding such that successive detection windows overlap.
 63. The method of claim 54 further comprising space-time adaptive processing to generate the input signal from multi-antenna signal streams.
 64. The method of claim 54 further comprising applying interference cancellation processing to the input signal before the high-rate linear MMSE detector.
 65. The method of claim 54 further comprising estimating and canceling interference based on recovered symbols included in the at least one detector output.
 66. The method of claim 54 further comprising applying forward error correction to the at least one detector output.
 67. An article comprising a machine readable medium including machine readable instructions that when executed by a machine cause the machine to: receive an input signal including at least one actual high rate user and a plurality of low rate users, the actual high rate user having a higher user rate than the low rate users; apply a high rate Minimum Mean Square Error (MMSE) transformation to the input signal over a high rate detection interval; and based on the MMSE transformation, generate at least one detector output corresponding to the at least one actual high rate user and the plurality of low rate users.
 68. The article of claim 67 wherein the at least one detector output is an actual high rate output corresponding to the at least one actual high rate user.
 69. The article of claim 67 further comprising generating at least one effective high-rate output corresponding to a group of the low-rate users.
 70. The article of claim 67 wherein the at least one detector output is a low-rate output corresponding to a one of the plurality of low-rate users.
 71. The article of claim 70 further comprising generating at least one effective high-rate output corresponding to a group of the low-rate users.
 72. The article of claim 70 further comprising combining successive high-rate outputs over a low-rate symbol period to generate the low rate output corresponding to the one of the plurality of low-rate users.
 73. The article of claim 72 wherein combining includes a transformation selected from a group consisting of decoupling combining and MMSE combining.
 74. The article of claim 67 further comprising selecting a detection window of the high rate MMSE transformation such that the high rate detection window is not a function of the detection interval.
 75. The article of claim 74 further comprising selecting the detection window to be greater than the high rate detection interval and sliding such that successive detection windows overlap.
 76. The article of claim 67 further comprising space-time adaptive processing to generate the input signal from multi-antenna signal streams.
 77. The article of claim 67 further comprising applying interference cancellation processing to the input signal before the high-rate linear MMSE detector.
 78. The article of claim 67 further comprising estimating and canceling interference based on recovered symbols included in the at least one detector output.
 79. The article of claim 67 further comprising applying forward error correction to the at least one detector output.
 80. A system comprising: a high-rate detector to recover received user symbols in the presence of low-rate user symbols, the high-rate detector operating over a detection window.
 81. The system of claim 80 wherein the high-rate detector includes a minimum mean square error (MMSE) detector.
 82. The system of claim 81 wherein the received user symbols include high-rate user symbols.
 83. The system of claim 81 wherein the received user symbols include low-rate user symbols.
 84. The system of claim 83 further comprising a decoupler combiner to process high-rate outputs of the MMSE detector over a low-rate interval to obtain the low-rate user symbols.
 85. The system of claim 83 further comprising an MMSE combiner to process high-rate outputs of the MMSE detector over a low-rate interval to obtain the low-rate user symbols.
 86. The system of claim 80 wherein the high-rate detector includes a linear detector.
 87. The system of claim 81 wherein the high-rate detector utilizes symbol-level processing.
 88. The system of claim 81 wherein the high-rate detector utilizes chip-level processing.
 89. The system of claim 83 wherein the MMSE detector models groups of the low-rate user symbols as effective high-rate user symbols.
 90. The system of claim 82 wherein the MMSE detector models groups of the low-rate user symbols as effective high-rate user symbols.
 91. A system comprising: an antenna to communicate information over a wireless link; a transceiver coupled to the antenna to convert received information to an input signal having received user symbols and low-rate user symbols; a baseband device coupled to the transceiver to implement system control; an input/output device coupled to the baseband device to provide a man-machine interface; and a high-rate detector to receive the input signal and to recover the received user symbols in the presence of the low-rate user symbols, the high-rate detector operating over a detection window.
 92. The system of claim 91 wherein the high-rate detector includes a minimum mean square error (MMSE) detector.
 93. The system of claim 92 wherein the received user symbols include high-rate user symbols.
 94. The system of claim 92 wherein the received user symbols include low-rate user symbols.
 95. The system of claim 94 further comprising a decoupler combiner to process high-rate outputs of the MMSE detector over a low-rate interval to obtain the low-rate user symbols.
 96. The system of claim 94 further comprising an MMSE combiner to process high-rate outputs of the MMSE detector over a low-rate interval to obtain the low-rate user symbols.
 97. The system of claim 91 wherein the high-rate detector includes a linear detector.
 98. The system of claim 92 wherein the high-rate detector utilizes symbol-level processing.
 99. The system of claim 92 wherein the high-rate detector utilizes chip-level processing.
 100. The system of claim 94 wherein the MMSE detector models groups of the low-rate user symbols as effective high-rate user symbols.
 101. The system of claim 93 wherein the MMSE detector models groups of the low-rate user symbols as effective high-rate user symbols. 